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.

Faculty Working in this Area

Last	First	Professional Title	Available To Advise?
Acar	Umut	Associate Professor	✔
Balcan	Maria	Professor	✔
Blelloch	Guy	Professor	✔
Blum	Manuel	University Professor Emeritus	✖
Gupta	Anupam	Professor	✔
Harchol-Balter	Mor	Professor	✔
Miller	Gary	Professor Emeritus	✖
O'Donnell	Ryan	Professor	✔
Rudich	Steven	Professor	✔
Sandholm	Tuomas	Angel Jordan University Professor of Computer Science	✔
Shi	Elaine	Associate Professor	✔
Sleator	Daniel	Professor	✔
Woodruff	David	Professor	✔

Subscribe to Algorithms and Complexity