I am a PhD student in theoretical computer science at MIT, advised by Virginia Vassilevska Williams. My research interests are mainly in graph algorithms including parameterized algorithms, dynamic algorithms, distributed algorithms, data structures, and fine-grained complexity.
I have a Masters in Computer Science from Stanford and a B.S. in Computer Science/Math from Harvey Mudd College where Ran Libeskind-Hadas sparked my interest in algorithms.
Towards Tight Approximation Bounds for Graph Diameter and Eccentricities
with Arturs Backurs, Liam Roditty, Gilad Segal, and Virginia Vassilevska Williams, in submission
Finding Cliques in Social Networks: A New Distribution-Free Model
with Jacob Fox, Tim Roughgarden, C. Seshadhri, and Fan Wei, in submission
I am a member of the Harvard Ballet Company.