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.
Research Groups & Labs
Theory of Computation Group
The Theory of Computation Group makes progress on fundamental problems in computer science, including algorithms, optimization, cryptography, quantum and more, to understand and expand the limits of the field.
Quantum Group
The Quantum Group does research on a variety of topics in quantum information and computation (primarily on the theory side), including quantum complexity theory, error-correction, cryptography, algorithms, and learning.
Faculty Members
Faculty
Adjunct Faculty
Faculty
Adjunct Faculty
Centers & Initiatives
eScience Institute
The eScience Institute empowers researchers and students in all fields to answer fundamental questions through the use of large, complex, and noisy data. As the hub of data-intensive discovery on campus, we lead a community of innovators in the techniques, technologies, and best practices of data science and the fields that depend on them.
Institute for Foundations of Data Science (IFDS)
IFDS organizes its research around four core themes: complexity, robustness, closed-loop data science, and ethics and algorithms. By making concerted progress on these fundamental fronts, IFDS aims to lower several of the barriers to better understanding of data science methodology and to its improved effectiveness and wider relevance to application areas.
Highlights
Allen School News
A chance encounter helped Paul Beame, Paris Koutris (Ph.D., ‘15) and Dan Suciu create the award-winning MPC model that aids scientists in understanding some of the deeper nuances surrounding big data management.
Allen School News
Shayan Oveis Gharan has all the ingredients of a trailblazing researcher who also happens to be a genuinely nice guy. The combination has proved to be a genuine recipe for success, as he has racked up a series of results — and accolades — in theoretical computer science.
Allen School News
After more than 30 years of stalled progress in the field, Victor Reis and Thomas Rothvoss of the Allen School’s Theory of Computation group earned a FOCS Best Paper award for nearly resolving the Subspace Flatness Conjecture for fast integer programming.