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
Adjunct Faculty
Faculty
Faculty
Faculty
Adjunct Faculty
Faculty
Faculty
Faculty
Faculty
Faculty
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.