Skip to main content Skip to navigation

FoCS People


Sayan Bhattacharya Dynamic graph algorithms, data structures, online algorithms, streaming algorithms, algorithmic game theory
Dmitry Chistikov Automata and formal languages, verification, discrete mathematics
Graham Cormode Algorithms, databases, data streaming, big data, data science
Artur Czumaj (Head) Randomized and approximation algorithms, algorithmic game theory
Charilaos Efthymiou Intersection of theory of algorithms, discrete mathematics, and statistical physics
Matthias Englert Online algorithms, approximation algorithms
Tom Gur Quantum computing, sublinear algorithms, complexity theory
Christian Ikenmeyer Computational complexity theory, tensor rank, computational representation theory, algebraic combinatorics, algebraic geometry
Marcin Jurdziński Algorithms, games, automata, logic
Dan Král' Graph theory, discrete mathematics, combinatorics
Ranko Lazic (Deputy) Formal verification, logic and automata
Torsten Mütze Graph theory, combinatorics, discrete algorithms, and their applications to real-world problems
Igor Carboni Oliveira Computational complexity theory and its connections to algorithms, combinatorics, and mathematical logic
Mike Paterson Combinatorial algorithms and complexity
Nick Spooner Interactive proof systems and zero knowledge in general, post-quantum cryptography, quantum information, coding theory and computational complexity
Ramanujan Sridharan Algorithms and complexity, fixed-parameter and approximation algorithms with a focus on graph and constraint satisfaction problems
FoCS Group May 2022
FoCS Group November 2019
FoCS Group May 2022

Research Fellows

Nathanaël Fijalkow Complexity (algorithms), data structures, theory of programming languages, logic, algebra, databases, control theory
Siddharth Gupta Graph algorithms, computational geometry
Shuichi Hirahara Computational complexity
Ian Mertz Computational complexity
Gopinath Mishra Algorithms
Anish Mukherjee Algorithms
Ninad Rajgopal Computational complexity
Sathyawageeswar Subramanian Quantum algorithms and complexity theory

Research Students

Hugo Aaronson Quantum computing and complexity theory
Andrei Codreanu Automata, logic, algorithms
Sam Coy Algorithms
Martin Costa Algorithms
Amelia Chui Algorithms
Marcel Dall’Angol Quantum computing and coding theory
Jacques Dark Streaming algorithms
Charlie Dickens Summaries and randomised algorithms for fundamental matrix computations and related problems
Alex Dixon Logics, Automata and Games, with a current focus on Petri Nets and variations on Vector Addition Systems
Chris Hickey Verification of data analysis algorithms
Peter Kiss Algorithms
Bruno Pasqualotto Cavalar Computational complexity and combinatorics
Arturo Merino Algorithms and discrete mathematics

Algorithms, complexity and discrete mathematics

Jack O'Connor

Quantum computing and learning theory

Aditya Prakash

Algorithms for automata and games

Mary Scott Differential privacy
Henry Sinclair-Banks Automata, Complexity, and Logic
Thejaswini K S Automata and Algorithmic Game Theory
Peter Strulo Fixed-parameter algorithms

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

Former Members