Carnegie Mellon University has a strong and diverse group in Algorithms and Complexity Theory. The goals of the group are, broadly speaking, 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.

Faculty working in this area:

Last First Title Emailsort descending
Gupta Anupam Professor
Beckmann Nathan Assistant Professor
Woodruff David Professor
Miller Gary Professor Emeritus
Blelloch Guy Professor
Harchol-Balter Mor Professor
Blum Manuel University Professor, Emeritus
Shah Nihar Assistant Professor
Balcan Nina Professor
O'Donnell Ryan Professor
Shi Elaine Associate Professor
Rudich Steven Professor
Schwartz Russell Professor
Vinayak Rashmi Korlakai Assistant Professor
Sandholm Tuomas Angel Jordan University Professor of Computer Science
Sleator Daniel Professor
Acar Umut Associate Professor
Wang Weina Assistant Professor
Subscribe to Theory