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
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.
Allen School News
The medal from the International Mathematical Union recognizes a researcher under the age of 40 who has made outstanding contributions in the mathematical aspects of the information sciences.
Quanta Magazine
Shayan Oveis Gharan, a professor in the Allen School’s Theory of Computation Group, received the 2026 IMU Abacus Medal from the International Mathematical Union for landmark contributions to the theory of algorithms.