Our study of the theoretical foundations of computing spans algorithm design and analysis, complexity, optimization, cryptography, quantum and more.
We seek to answer fundamental and long-standing questions about the capabilities and limitations of our field, which has practical implications in economics, logistics, social welfare, transportation and many other real-world domains.
Allen School Faculty
Accessible Accordion
Areas of Expertise
Societal Impact
Results will appear in alphabetical order.
Assistant Professor
Professor
Assistant Professor
Associate Professor
Associate Professor
Professor
Associate Professor
Professor
Assistant Professor
Professor
Professor
Professor
Professor
Professor
Professor
Assistant Teaching Professor
Highlights
Quanta Magazine
Oveis Gharan, a member of the Allen School’s Theory of Computation Group, was honored by the International Mathematical Union for his landmark contributions to the theory of algorithms.
Allen School News
In the award-winning paper, Nirkhe and his collaborators resolved a longstanding problem in quantum complexity theory by proving that quantum proofs are computationally more powerful than classical proofs.
Institute for Foundations of Data Science
The International Conference on Artificial Intelligence and Statistics (AISTATS) recognized Jamieson for his 2016 paper underpinning an approach to hyperparameter optimization that has been widely adopted within the machine learning community.