Algorithms and Complexity

Researchers in our Algorithms and Complexity Theory group aim to provide a mathematical understanding of fundamental issues in computer science, and to use this understanding to produce better algorithms, protocols and systems, and identify the inherent limitations of efficient computation. Research interests include data structures, algorithm design, complexity theory, coding theory, parallel algorithms and languages, machine learning theory, cryptography and security, computational aspects of economics, online algorithms, and scientific computing. We welcome students who have a combination of theoretical and application-oriented research interests.

Subscribe to Algorithms and Complexity