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.
Adjunct & Emeritus Faculty
Accessible Accordion
Areas of Expertise
Societal Impact
Results will appear in alphabetical order.
Adjunct Faculty
Adjunct Faculty
Adjunct Faculty
Adjunct Faculty
Adjunct Faculty
Highlights
Allen School News
Li (B.S., ‘13) and his collaborators received the award for resolving a foundational problem in robust statistics, proving that a broad class of high-dimensional statistical problems can be both efficiently and robustly solved, even when some of the data has been corrupted.
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.