People

Permanent Members
Amin Coja-Oghlan Combinatorics, probability, and efficient algorithms
Artur Czumaj Randomized and approximation algorithms, algorithmic game theory
Matthias Englert  Online algorithms, approximation algorithms
Marcin Jurdziński Algorithmic game theory, formal methods, logic and automata
Ranko Lazic Formal methods, logic and automata
Rajagopal Nagarajan Quantum computation, distributed computing, information security
Mike Paterson Combinatorial algorithms and complexity
Maxim Sviridenko Combinatorial algorithms and optimisation
Alex Tiskin Parallel computation, combinatorics, string matching


Post-docs

Charilaos Efthymiou  Randomized algorithms and random structures
Andrew Handley  Randomized and distributed algorithms
Benjamin Sach String matching, streaming algorithms
Troels Bjerre Sørensen  Algorithmic game theory
Christine Zarges Randomized algorithms, search heuristics, graph algorithms


Research Students

Anna Adamaszek  Graph theory, Approximation algorithms
Michal Adamaszek  Algebraic topology, Combinatorial topology, Combinatorics
Ebrahim Ardeshir  Quantum information processing
Rahil Baber 
Timothy Davidson Quantum computing
Matthew Felice Pace
Jan Hladký  Combinatorics, Graph theory, Extremal graph theory
Nicolaos Matsakis Algorithms
Michał Rutkowski Automata and language theory, Hybrid automata and systems, First order theories, Games


Some new positions are available through the Centre for Discrete Mathematics and its Applications (DIMAP).

Former Members