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 Titlesort descending Email
Sandholm Tuomas Angel Jordan Professor of Computer Science
Acar Umut Associate Professor
Procaccia Ariel Associate Professor
Haeupler Bernhard Associate Professor
Goyal Vipul Associate Professor
Woodruff David Associate Professor
Von Ahn Luis Consulting Professor
Guruswami Venkatesan Director of Doctoral Programs, Professor
Blelloch Guy Professor
Sleator Daniel Professor
Miller Gary Professor
Rudich Steven Professor
Harchol-Balter Mor Professor
Balcan Nina Professor
Gupta Anupam Professor
O'Donnell Ryan Professor
Blum Manuel University Professor, Emeritus
Subscribe to Algorithms and Complexity