Research in the Algorithms and Computational Complexity Research Group is concerned with various topics of Theoretical Computer Science, Algorithms, and Complexity Theory. 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. In particular, we study the inherent (mathematical) limits which determine what can (and what cannot) be efficiently computed. The method of our research is to consider particular computational problems and, for each problem, (1) to study the limits which determine how quickly the problem can be solved on a computer, and (2) to develop algorithms for solving the problem which are as efficient as possible. 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, and
  
• string matching.

We are one of the core groups affiliated with the newly created Centre for Discrete Mathematics and its Applications (DIMAP) at the University of Warwick.

We meet regularly at the Algorithms Seminar and even more frequently on DIMAP seminars.

More information about the research (including lists of publications) can be found on the web pages of the individual members of the Algorithms and Computational Complexity Research Group and on DIMAP Centre web pages.

More information about our research activities and achievements can be found here.

Information about our teaching activities is available here.

PhD Fellowships

• 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.

New post doc position

• Together with the Centre for Discrete Mathematics and its Applications (DIMAP), we have a new postdoctoral fellow position in the broadly understood areas of Theoretical Computer Science, Algorithms and Complexity, Game Theory, and Discrete Mathematics. See here for more details.

  The deadline for the applications is on Wednesday 17 February 2010.