People
Click on a name to reach a member’s webpage where you can find more details about them and their activities, and contact details. Many members make available preprints of their publications.
You can also find out where in the world you can find some of our former members.
| Academic Staff | |
| Eleni Akrida | graph algorithms and complexity, as well as approximation algorithms and probabilistic analysis of algorithms. |
| Magnus Bordewich | counting problems; randomised algorithms; Markov Chain Monte Carlo sampling techniques; phylogenetics. |
| Stefan Dantchev | computational complexity; proof complexity; logic; constraint satisfaction; SAT solving. |
| Thomas Erlebach | algorithmic aspects of communication networks; time-varying graphs and networks; computing with explorable uncertainty; approximation and on-line algorithms for combinatorial optimisation problems. |
| Peter Davies | graph algorithms, randomized algorithms, communications networks, derandomization, probabilistic method |
| Tom Friedetzky | randomised algorithms; probabilistic analysis; sub-linear time algorithms; load balancing. |
| Pooya Farshim | cryptography, security analysis of protocols, foundations of cryptography; idealised models of computation, advanced primitives (in particular obfuscation, multi-linear maps, and functional encryption); automated security analysis. |
| Maximilien Gadouleau | coding theory, network coding and information theory; finite dynamical systems, including boolean networks and cellular automata; memoryless computation; transformation semigroups. |
| Nicholas Georgiou (Department of Mathematical Sciences) | probabilistic combinatorics; (random) processes on (random) graphs; probabilistic models and stochastic processes. |
| Tyler Helmuth (Department of Mathematical Sciences) | spin systems, expansion methods in statistical mechanics, self-interacting random walks, approximate counting and sampling algorithms. |
| Ioannis Ivrissimtzis | multiresolution geometry, geometric modeling particularly subdivision surfaces, mesh encoding and applying statistical learning methods in surface reconstruction. |
| Matthew Johnson | graph theory including colouring, algorithms and decompositions; combinatorial optimization. |
| Andrei Krokhin | constraint satisfaction, combinatorial optimization, universal algebra, logic, finite model theory. |
| Barnaby Martin | computational and proof complexity, logic, constraint satisfaction, graph theory, SAT solving. |
| George Mertzios | algorithms and complexity, foundations of networks, combinatorial optimization and algorithmic game theory. |
| Billy Moses Jr. | distributed algorithms; movement and computing; fault tolerant computing; distributed algorithms for dynamic networks; graph algorithms; randomized algorithms; biologically inspired computing |
| Daniel Paulusma | graph theory and algorithms; combinatorial optimization; cooperative game theory. |
| Norbert Peyerimhoff (Department of Mathematical Sciences) | spectral geometry, schrodinger operators, symmetric spaces, dynamical systems, graph theory. |
| Robert Powell | computational complexity, constraint satisfaction. |
| Igor Razgon | computational complexity, parameterized complexity, knowledge representation. |
| Iain Stewart | interconnection networks for parallel computing; descriptive and computational complexity, finite model theory; group theory; graph algorithms; theoretical aspects of AI; GPGPU computing. |
| Amitabh Trehan | algorithms, distributed computing and algorithms, networks, resilience, self-healing networks, self-* properties, dynamic multi-agent systems, game theory, graph theory. |
| Thirupathaiah Vasantam | applied probability and queueing theory; performance modelling and analysis of communication networks; quantum networking; data-centre networks and cloud computing; sequential analysis and changepoint detection |
| Research Staff | |
| Kristina Asimi | constraint satisfaction, computational complexity, universal algebra |
| Karl Southern | side-channel resistant cryptography, cryptanalysis and security of primitives in the random oracle model |
| Mengxiao Zhang | algorithmic mechanism design, privacy computing, algorithms for kidney exchange |
| Research Students | |
| Henry Austin | |
| Elizabeth Callander | |
| Tala Eagling-Vose | |
| David Fairbairn (Department of Mathematical Sciences) | |
| David Kutner | |
| Xin Ye |