The Division of Theory and Foundations (aka FoCS: Foundations of Computer Science Research Group) is one of the four divisions in the Department of Computer Science at the University of Warwick, one of the leading Computer Science departments in the United Kingdom.
Research in FoCS 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:
- randomised and approximation algorithms,
- network algorithms,
- complexity theory,
- discrete mathematics, combinatorics, and their applications,
- parallel and distributed algorithms,
- algorithmic aspects of game theory and economics,
- graph algorithms,
- string matching,
- logic, automata and games in computer science,
- algorithms and complexity of formal verification and synthesis,
- formal methods for probabilistic, real-time, hybrid, mobile, quantum and biological systems,
- testing, model checking, deductive verification.
We are the core group affiliated with the Centre for Discrete Mathematics and its Applications (DIMAP) at the University of Warwick.
We meet regularly on DIMAP seminars.
More information about our research activities and achievements can be found here.
Information about our teaching activities is available here.
- Full Professor in Computer Science (closing date: January 5, 2017); the call is open to candidates working in all areas of Computer Science including those related to the DIMAP research focus
- Professor/Reader in Data Science (CS, maths, stats) (closing date: January 31, 2017); the call is open to candidates working in all areas of Computer Science, Mathematics, Statistics related to Data Science, including those related to the DIMAP research focus
- ERC-funded postdoc with Dan Král' (closing date: January 5, 2017)
- EPSRC-funded postdoc with Dan Král' (closing date: January 5, 2017)
- Post-doc (focus on sublinear algorithms, randomized algorithms, streaming, property testing) with Artur Czumaj
The research group has funding available to support PhD studentships. Funding covers both academic fees (typically only EU tuition) and subsistence. The main source of funding is through DIMAP PhD studentships; please see there for more details.
Prospective PhD students or other people with a research-related interest: Please feel free to browse our web pages and contact any member of our group for more information.
Information about applying to the university is here.