Members of the Algorithms and Computational Complexity Research Group are involved in a variety of teaching and educational activities related to Algorithms, Data Structures, Complexity, and Discrete Mathematics.
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 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.
As one of the leading international research groups in Theoretical Computer Science, our teaching combines a mix of the standard computer science education in Foundations of Computer Science and Algorithms and Computational Complexity, with the cutting edge scientific expertize that bring to the students the most recent advances in this subject. Our aim is to provide our students with an insight into the problems and challenges in Computer Science and Algorithms, thereby gaining the skills critical to the modern Computing.
The following is the list of modules currently taught by the members of the Algorithms and Computational Complexity Research Group:
- CS136 Discrete Mathematics and its Applications 1 (this year web page)
- CS137 Discrete Mathematics and its Applications 2 (this year web page)
- CS243 Data Structures and Algorithms (this year web page)
- CS244 Algorithm Design (this year web page)
- CS254 Algorithmic Graph Theory (this year web page)
- CS301 Complexity of Algorithms (this year web page)
- CS329 Efficient Parallel Algorithms (not taught in this academic year)
- CS341 Advanced Topics in Algorithms (this year web page)
- CS409 Algorithmic Game Theory (this year web page)
The Algorithms and Computational Complexity Research Group has also three more research oriented activities:
- Algorithms and Complexity Seminar (which is a subset of DIMAP Seminar)
- DIMAP Seminar (which is a superset of Algorithms and Complexity Seminar)
- Junior Seminar