Hi! I'm a fourth year PhD student in EECS at MIT, advised by Ronitt Rubinfeld. I'm interested in pseudorandomness, graph theory, space complexity, and more. As an undergraduate, I was extremely fortunate to be advised by Salil Vadhan.
If you have questions or comments, please reach out!
epyne [at] mit.edu
Efficient Catalytic Graph Algorithms. [arXiv:2509.06209]
with James Cook.
Collapsing Catalytic Classes. [ECCC-TR25-019]
with Michal Koucký, Ian Mertz, and Sasha Sami.
FOCS 2025. (To appear)
When Connectivity is Hard, Random Walks are Easy With Non-Determinism. [ECCC-TR25-077]
with Dean Doron, Roei Tell, and Ryan Williams.
STOC 2025.
Derandomizing Logspace With a Small Shared Hard Drive. [ECCC-TR23-168]
CCC 2024. Invited to special issue of Computational Complexity.
Best Student Paper.
Certified Hardness vs. Randomness for Logspace. [ECCC-TR23-040]
FOCS 2023.
with Ran Raz and Wei Zhan.
Near-Optimal Derandomization of Medium-Width Branching Programs. [ECCC-TR22-150]
STOC 2023.
with Aaron (Louie) Putterman.