Theory @ Georgetown
Located in the Department of Computer Science at Georgetown University, the Theory & Algorithms Group consists of nine faculty members, along with PhD students and postdocs, focused on core topics in both theoretical computer science and algorithms, with a particular emphasis on problems with practical applications.
We are always looking for new graduate students and postdocs who are interested in joining our large and highly collaborative group. We offer an environment in which you can interact with multiple faculty members and be exposed to many cutting edge topics. Feel free to contact any of our professors for collaborative opportunities.
news
Aug 20, 2024 | Laasya Bangalore successfully defended her Ph.D. dissertation “On Round-Efficient Black-Box Constructions of Cryptographic Protocol”. |
---|---|
Jul 01, 2024 | Matrix Multiplication Verification Using Coding Theory coauthored by Huck Bennett , Karthik Gajulapalli , Alexander Golovnev , Evelyn Warton gets accepted to RANDOM 2024. |
Jul 01, 2024 | Hilbert Functions and Low-Degree Randomness Extractors coauthored by Alexander Golovnev, Zeyu Guo, Pooya Hatami, Satyajeet Nagargoje, Chao Yan gets accepted to RANDOM 2024. |
Jun 19, 2024 | On the Power of Adaptivity for Function Inversion coauthored by Karthik Gajulapalli, Alexander Golovnev, Samuel King gets accepted to ITC 2024. |
Jun 18, 2024 | Jeremy Fineman has won the Best Paper Award at STOC 2024 for his work Single-Source Shortest Paths with Negative Real Weights in Õ(mn^(8/9)) Time. |