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 Title Emailsort descending
Gupta Anupam Professor
Procaccia Ariel Associate Professor
Von Ahn Luis Consulting Professor
Woodruff David Associate Professor
Miller Gary Professor
Goyal Vipul Associate Professor
Blelloch Guy Professor, Assoc. Dean for Undergraduate Programs
Haeupler Bernhard Assistant Professor
Harchol-Balter Mor Professor
Blum Lenore Distinguished Career Professor of CS
Blum Manuel Bruce J. Nelson University Professor
Balcan Nina Associate Professor
O'Donnell Ryan Professor
Rudich Steven Professor
Sandholm Tuomas Professor
Sleator Daniel Professor
Acar Umut Associate Professor
Guruswami Venkatesan Professor
Subscribe to Algorithms and Complexity