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:

Lastsort descending First Title Email
Acar Umut Associate Professor
Balcan Nina Professor
Blelloch Guy Professor
Blum Manuel University Professor, Emeritus
Goyal Vipul Associate Professor
Gupta Anupam Professor
Guruswami Venkatesan Director of Doctoral Programs, Professor
Haeupler Bernhard Associate Professor
Harchol-Balter Mor Professor
O'Donnell Ryan Professor
Rudich Steven Professor
Sandholm Tuomas Angel Jordan University Professor of Computer Science
Sleator Daniel Professor
von Ahn Luis Consulting Professor
Woodruff David Associate Professor
Subscribe to Algorithms and Complexity