Theory and Algorithms
Theory and algorithms research explores the fundamental limits of computation and designs efficient, provably correct methods for solving computational problems. Georgetown CS researchers advance fundamental data structures, computational complexity, and cryptographic foundations while developing algorithms for parallel, distributed, online, and graph-based systems.
Strengths and Impact
Research Efforts and Groups
Faculty
Professor and Wagner Chair in Computer Science | Director of Graduate Studies
Balasubramanian Kalyanasundaram
Craves Family Professor
Professor | Director of Undergraduate Studies
Professor and Robert L. McDevitt, K.S.G., K.C.H.S. and Catherine H. McDevitt L.C.H.S. Term Chair in Computer Science
Provost’s Distinguished Associate Professor
Robert L. McDevitt, K.S..G., K.C.H.S. and Catherine H. McDevitt L.C.H.S. Chair
Professor & McBride Family Endowed Chair
Muthuramakrishnan Venkitasubramaniam
Professor
Assistant Professor
News
News Story
Sam King successfully defends his Ph.D. dissertation
Sam King (advisors: Sasha Golovnev and Jeremy Fineman) successfully defended his Ph.D. dissertation “Time vs Space Trade-offs with Complexity-Theoretic Applications”.
July 13, 2026