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