Algorithms and Complexity

The field of algorithms and complexity is concerned with the development, analysis, and evaluation of algorithms and data structures that enable efficient computation and problem-solving, as well as the study of the inherent complexity of computational problems and the design of algorithms that can handle such problems efficiently. Some of the topics faculty and students in these areas explore include the following:

• Algorithm design and analysis
• Cache-Efficient Algorithms
• Computational complexity theory
• Parallel Algorithms
• Parallel and external-memory algorithms
• String algorithms

Core Faculty

Michael Bender

View Profile

Rezaul Chowdhury

View Profile

Pramod Ganapathi

View Profile

Himanshu Gupta

View Profile

Supartha Podder

View Profile

Steven Skiena

View Profile

Yifan Sun

View Profile

Dominik Kempa

View Profile

Affiliated Faculty

Esther Arkin

View Profile

Xiangmin Jiao

View Profile

Joseph S.B. Mitchell

View Profile

Yi Liu

View Profile

Zhenhua Liu

View Profile