Research in Theory

Synopsis of the research area

Theoretical Computer Science is the branch of computer science that designs algorithmic solutions to computational problems and studies their complexity in various models of computation (automata, Turing machines, etc). Problems of interest span many areas of science and engineering, and have numerous applications in the real world.

Members of the theory group in the School of Computing are active in several areas of Theoretical Computer Science, including Complexity Theory, Graph Theory and Algorithms, Parallel and Distributed Algorithms and Systems, Combinatorial Optimization, Computational Geometry and Topology, and Quantum Computation.

Recent Publications