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
Procaccia Ariel Associate Professor
Beckmann Nathan Assistant Professor
Von Ahn Luis Consulting Professor
Woodruff David Associate Professor
Xing Eric P. Professor
Miller Gary Professor
Goyal Vipul Associate Professor
Blelloch Guy Professor, Assoc. Dean for Undergraduate Programs
Haeupler Bernhard Assistant Professor
Harchol-Balter Mor Professor
Carbonell Jaime Director LTI; Newell University Professor
Yang Jean Assistant Professor
Blum Lenore Distinguished Career Professor of Computer Science
Blum Manuel Bruce J. Nelson University Professor
Shah Nihar Bhadresh Assistant Professor
Balcan Nina Associate Professor
O'Donnell Ryan Professor
Rudich Steven Professor
Schwartz Russell Professor
Vinayak Rashmi Korlakai Assistant Professor
Sandholm Tuomas Angel Jordan Professor of Computer Science
Sleator Daniel Professor
Acar Umut Associate Professor
Guruswami Venkatesan Professor
Wang Weina Assistant Professor
Subscribe to Theory