I am a PhD student in theoretical computer science at MIT, fortunate to be advised by Virginia Vassilevska Williams.
My research interests are mainly in graph algorithms including dynamic algorithms, parameterized algorithms, distributed algorithms, data structures, and fine-grained complexity. I am more broadly interested in any algorithmic problem that is combinatorial in nature.
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. During undergrad I did an REU with Glencora Borradaile.
I am the organizer of Algorithms Office Hours at MIT, whose goal is to improve communication between theory and applications of algorithms.
2020
New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs
with Maximilian Probst Gutenberg and Virginia Vassilevska Williams
STOC
[arXiv]
2019
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems
with Mina Dalirrooyfard, Virginia Vassilevska Williams, and Nikhil Vyas
ICALP
[arXiv]
Approximation Algorithms for Min-Distance Problems
with Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Yinzhan Xu, and Yuancheng Yu
ICALP
[arXiv]
Algorithms and Hardness for Diameter in Dynamic Graphs
with Bertie Ancona, Monika Henzinger, Liam Roditty, and Virginia Vassilevska Williams
ICALP
[arXiv]
2018
Improved Dynamic Graph Coloring
with Shay Solomon
ESA
[arXiv] [mentioned in blog post]
Finding Cliques in Social Networks: A New Distribution-Free Model
with Jacob Fox, Tim Roughgarden, C. Seshadhri, and Fan Wei
ICALP
[arXiv] [video]
Fully Dynamic MIS in Uniformly Sparse Graphs
with Krzysztof Onak, Baruch Schieber, and Shay Solomon
ICALP
[arXiv]
Towards Tight Approximation Bounds for Graph Diameter and Eccentricities
with Arturs Backurs, Liam Roditty, Gilad Segal, and Virginia Vassilevska Williams
STOC
[arXiv] [video]
I am a member of the Harvard Ballet Company.