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