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 Titlesort ascending Email
Blum Manuel University Professor, Emeritus
Miller Gary Professor Emeritus
Blelloch Guy Professor
Sleator Daniel Professor
Rudich Steven Professor
Harchol-Balter Mor Professor
Balcan Nina Professor
Gupta Anupam Professor
Schwartz Russell Professor
O'Donnell Ryan Professor
Woodruff David Professor
Acar Umut Associate Professor
Shi Elaine Associate Professor
Beckmann Nathan Assistant Professor
Shah Nihar Assistant Professor
Vinayak Rashmi Korlakai Assistant Professor
Wang Weina Assistant Professor
Sandholm Tuomas Angel Jordan University Professor of Computer Science
Subscribe to Theory