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.

News

Portrait of Tuomas Sandholm.

Sandholm Earns Alfred Kordelin Prize for AI Research With Global Impact

Monday, November 24, 2025

Tuomas Sandholm, the Angel Jordan University Professor of computer science at Carnegie Mellon University, has been awarded the Alfred Kordelin Prize, one of Finland's most prestigious honors recognizing outstanding contributions to science, the arts and public education. The 50,000-euro award, presented annually by the Alfred Kordelin Foundation, honors individuals whose work advances Finnish society through innovation, diversity and international reach. Read More

Seminar Series

ACO Seminars

Faculty Researchers Working in this Area

Subscribe to Algorithms and Complexity