Theory and Foundations
Overview of theme
Research in our Theory and Foundations division is concerned with various topics of Theoretical Computer Science, such as design and analysis of algorithms, complexity theory, logic, automata and formal verification. Our research aims at providing understanding of fundamental problems arising in Computer Science and to design mathematical tools and better algorithms to solve these problems.
Our key research areas include:
- algorithmic aspects of game theory and economics
- automata and formal languages
- cryptography and quantum computing
- combinatorics, and their applications
- logic and games
- parallel and distributed algorithms
- random structures and randomized algorithms
- string algorithms
- computational complexity
- discrete mathematics
- graph and network algorithms
- online and dynamic algorithms
- parameterized complexity and structural graph theory
- sublinear and streaming algorithms
Publications and Projects
Our Publications list provides details of our published papers in books, journals and conferences.
We are involved in many diverse research projects funded by several external bodies such as UK Research and Innovation, The Royal Society, EPSRC etc.
Theory and Foundations News
Best Paper Award at QEST+FORMATS 2024
PhD Studentship Opportunities in Theoretical Computer Science
Archive news
Theory and Foundations Events
Fri 17 May '24
DIMAP Theory Highlights 2024,
Radcliffe (Space 17),
Event starts at 1pm.
DIMAP Seminar: Andrew Ryzhikov (University of Oxford)
Complexity Seminar: Jingxun Liang (CMU)
DIMAP Theory Highlight 2024
 On May the 17th, FoCS & DIMAP held the workshop DIMAP Theory Highlights 2024. The event was attended by students and staff members of FoCS and DIMAP. The workshop offered an opportunity for the members of the group to get together, interact with each other, and hear about some exciting developments in the research areas of interest to staff in the theory group. For further information see here. |