Skip to main content

FoCS People

Permanent Members

Sayan Bhattacharya Dynamic graph algorithms, data structures, online algorithms, streaming algorithms, and algorithmic game theory
Dmitry Chistikov Automata and formal languages, verification, discrete mathematics
Graham Cormode Algorithms, databases, data streaming, big data, data science
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
Dan Král' Graph theory, discrete mathematics, combinatorics
Ranko Lazic Formal verification, logic and automata
Mike Paterson Combinatorial algorithms and complexity
Ramanujan Sridharan Algorithms and complexity, fixed-parameter and approximation algorithms with a focus on graph and constraint satisfaction problems
Alex Tiskin Parallel computation, combinatorics, string matching



Research Fellows

Golnaz Badkobeh String algorithms
Ping Hu Extremal combinatorics, probabilistic methods
Tamás Hubai Graph limits
Hossein Jowhari Streaming algorithms, algorithms for bigdata
Christian Konrad Algorithms
Filip Mazowiecki Logic, automata and databases
Steven Ramsay Logic, semantics and lambda calculus, in connection with algorithms for verifications
Patrick Totzke Formal verification and logic



Research Students

Jacob Cooper Combinatorics
Rafael da Ponte Barbosa Combinatorial optimisation
Jacques Dark Streaming algorithms
Peter Davies Algorithms
Michail Fasoulakis Algorithmic game theory
Michael Hebdige Graph theory
Tejas Kulkarni Data Anonymization
Nicolaos Matsakis Algorithms
Jakub Sosnovec Combinatorics, graph algorithms



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


Former Members