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