Carnegie Mellon University has a strong and diverse group in Algorithms and Complexity Theory. We try to provide a mathematical understanding of fundamental issues in Computer Science, and to use this understanding to produce better algorithms, protocols, and systems, as well as 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.

Our Algorithms and Complexity group maintains strong ties to other areas, such as computer systems, programming languages, and artificial intelligence, and we welcome students who have a combination of theoretical and application-oriented research interests. See the ACO Program home page (old page here) for the inter-disciplinary program in Algorithms, Combinatorics and Optimization.

Alum David Wajc and former student visitor Binghui Peng win best paper/student paper awards at SODA 2023

(advised by Venkatesan Guruswami and Pravesh Kothari)

(advised by Guy Blelloch)

(advised by Vipul Goyal)

(advised by Vipul Goyal)

(advised by Guy Blelloch)

(advised by Weina Wang)

UNC Chapel Hill

Ph.D. 2022

Ph.D. 2022

Ph.D. 2021

Purdue

Ph.D. 2014

Ph.D. 1998