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.
Faculty Members
Accessible Accordion
Areas of Expertise
Societal Impact
Results will appear in alphabetical order.
Adjunct Faculty
Faculty
Faculty
Faculty
Faculty
Adjunct Faculty
Adjunct Faculty
Adjunct Faculty
Adjunct Faculty
Faculty
Faculty
Faculty
Faculty
Faculty
Faculty
Faculty
Adjunct Faculty
Faculty
Faculty
Faculty
Faculty
Faculty
Highlights
Allen School News
In the award-winning paper, Tang developed the first quantum state obfuscation scheme for unitary quantum programs, which are the backbone of quantum computing, in the classical oracle model. He presented the research at the 66th IEEE Symposium on Foundations of Computer Science last December.
Allen School News
Rothvoss, who is a member of the Allen School’s Theory of Computation Group, collected the inaugural Trevisan Prize in the mid-career category for his breakthrough contributions in the study of optimization problems.
Allen School News
Professors Simon Shaolei Du and Ranjay Krishna, and Sewon Min (Ph.D., ‘24), now faculty at University of California, Berkeley and a research scientist at Ai2, were honored by MIT Technology Review for their work in AI, large language models, computer vision and more.