I am a PhD student student at Georgetown University advised by Sasha Golovnev.

I am broadly interested in theoretical computer science, especially complexity theory and theoretical cryptography. Some specific problems I am very interested in:

• Circuit Range Avoidance and Unconditional Circuit Lower Bounds
• Fine-Grained Complexity and Conditional Lower Bounds
• Pseudo-Deterministic Algorithms
• Complexity of Optimal Compression Algorithms
• Data Structure Lower Bounds

I am currently visiting Huck Bennett at beautiful CU Boulder working on designing fine-grained algorithms for matrix problems. Previously, I had visited Simons in Spring 2023 for their program on Meta-Complexity, and in Fall 2019 for their program Online and Matching-Based Market Design.

Before coming to Georgetown I got both my undergraduate and masters degrees from UC Irvine where I was advised by Vijay Vazirani.

Here is a flyer for a fun talk I gave as undergrad trying to recruit unsuspecting students to work on complexity theory with me.

Contact Information

328 St. Mary's Hall, Gerogetown University
email: kg816 at georgetown dot edu