Research in theoretical computer science and algorithmic foundations includes algorithm design and analysis, computational complexity, discrete mathematics, and data structures. The defining character of the area is the use of rigorous mathematical proofs, which help in understanding the fundamental limits of computation and the development of highly efficient, scalable solutions with provable guarantees. The department also has strength in emerging computational paradigms, including sublinear algorithms, numerical linear algebra, and continuous optimization.
Representative topics include:
- Design and analysis of algorithms
- Computational complexity theory
- Graph theory and graph algorithms
- Sublinear algorithms
- Learning algorithms
- Numerical linear algebra
- Combinatorial and continuous optimization
