Editorial board

Editor-in-Chief

Mitsunori Ogihara
(computational complexity; molecular computation)
Department of Computer Science
University of Miami
Coral Gables, United States of America
ogihara@cs.miami.edu 

Editorial Board

Harry M. Buhrman
(computational complexity; quantum computing; distributed computing; Kolmogorov complexity)
Centrum voor Wiskunde en Informatica, Netherlands

Yijia Chen
(logic; complexity; algorithmic graph theory)
Shanghai Jiao Tong University, China

Rod Downey
(parameterized and structural complexity; exact algorithms; algorithmic information theory; effective mathematics)
Victoria University, New Zealand

Thomas Erlebach
(approximation algorithms; online algorithms; graph algorithms; algorithmic aspects of communication networks)
Durham University, United Kingdom

Guy Even
(graph algorithms; approximation algorithms)
Tel-Aviv University, Israel

Pierre Fraigniaud
(theory of communication networks; routing, broadcasting, searching; mobile computing; network models)
CNRS & Université de Paris, France

Anna C. Gilbert
(randomized algorithms, especially streaming and sublinear algorithms; theory of communication networks; data compression algorithms)
Yale University, United States of America

Seth Gilbert
(distributed algorithms; parallel algorithms; fault-tolerance, robustness)
National University of Singapore (NUS), Singapore

Sheila A. Greibach
(automata and formal languages; machine-based complexity theory)
University of California, Los Angeles, United States of America

Roberto Grossi
(combinatorial pattern matching; dynamic data structures; external memory algorithms; string algorithms; text indexing)
Università di Pisa, Italy 

Kohei Hatano
(machine learning; computational learning theory; online learning)
Kyushu University, Japan

Fei He
(formal verification; program language; automated logic reasoning)
Tsinghua University, China 

Jérôme Lang
(Bayes nets; combinatorial optimization; logic in CS; machine learning)
Université Paris-Dauphine, France

Asaf Levin
(algorithms; combinatorial optimization; scheduling)
The Technion – Israel Institute of Technology, Israel

Markus Lohrey 
(complexity of algebraic problems; automata theory; parallel complexity; data compression)
Universität Siegen, Germany

Fabrizio Luccio
(models of computation; algorithms and data structures; computational molecular biology)
Università di Pisa, Italy 

Sebastian Maneth
(automata and formal languages; algorithms for compressed structures; theory of databases and programming languages)
Universität Bremen, Germany 

Bernard Mans
(distributed algorithms; data structures; applied graph theory)
Macquarie University, Australia 

Elvira Mayordomo
(algorithmic information theory; computational complexity; Kolmogorov complexity)
Universidad de Zaragoza, Spain

Harumichi Nishimura
(computational complexity; quantum computing)
Nagoya University, Japan

Giuseppe Persiano
(foundations of cryptography; algorithmic game theory;  approximation algorithms)
Università di Salernovia, Italy 

Rajmohan Rajaraman
(parallel and distributed computing; approximation algorithms; algorithmic game theory; networks)
Northeastern University, United States of America 

Kenneth W. Regan
(algorithmic information theory and randomness; algorithms for the memory hierarchy; approximate algorithms for hard problems)
University at Buffalo, The State University of New York, United States of America

Adi Rosén
(online algorithms; streaming algorithms; communication complexity and private multi-party computation; communication networks: routing and scheduling)
CNRS & Université de Paris, France

Arnold L. Rosenberg
(theoretical aspects of parallel algorithms and architectures and of networks; applied graph theory)
University of Massachusetts, United States of America

Atri Rudra
(theory of error-correcting codes; sublinear algorithms; database algorithms, communication complexity)
University at Buffalo, The State University of New York, United States of America 

Saket Saurabh
(parameterized complexity; graph algorithms; graph theory; exact algorithms)
Institute of Mathematical Sciences, India   

Paul Spirakis
(analysis of algorithms; approximate algorithms for hard problems; communication networks; parallel computing; mobile computing)
University of Liverpool, United Kingdom  

Ramanujan Sridharan
(algorithms; graph algorithms; graph theory; randomized algorithms)
University of Warwick, United Kingdom 

Paul Vitanyi
(Kolmogorov complexity; distributed algorithms; machine learning; physics and computation)
Centrum voor Wiskunde en Informatica, Netherlands