Algorithms and Complexity

Researchers in our Algorithms and Complexity Theory group aim to provide a mathematical understanding of fundamental issues in computer science, and to use this understanding to produce better algorithms, protocols and systems, and 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. We welcome students who have a combination of theoretical and application-oriented research interests.

http://theory.cs.cmu.edu

Faculty working in this area:

Lastsort descending First Title Email
Acar Umut Associate Professor umut@cs.cmu.edu
Balcan Nina Professor ninamf@cs.cmu.edu
Blelloch Guy Professor guyb@cs.cmu.edu
Blum Manuel University Professor, Emeritus mblum@cs.cmu.edu
Gupta Anupam Professor anupamg@cs.cmu.edu
Harchol-Balter Mor Professor harchol@cs.cmu.edu
Miller Gary Professor Emeritus glmiller@cs.cmu.edu
O'Donnell Ryan Professor odonnell@cs.cmu.edu
Rudich Steven Professor rudich@cs.cmu.edu
Sandholm Tuomas Angel Jordan University Professor of Computer Science sandholm@cs.cmu.edu
Sleator Daniel Professor sleator@cs.cmu.edu
Woodruff David Professor dwoodruf@cs.cmu.edu
Subscribe to Algorithms and Complexity