I am a postdoctoral researcher in Theoretical Computer Science at INSAIT.
I am interested in fine-grained complexity and algorithm design, and especially enjoy thinking about problems concerning graph algorithms, string algorithms, and applications of algebraic methods in computer science.
Previously, I completed my PhD in Theoretical Computer Science at MIT, advised by both Virginia Vassilevska Williams and Ryan Williams.
Prior to that, I received a B.S. in Computer Science & Mathematics from Harvey Mudd College. I have been fortunate to have several excellent mentors and, in particular, am indebted to JJP Veerman, Mohamed Omar, Jim Boerkoel, and Ran Libeskind-Hadas for sparking my interest in research.
You can contact me using the email listed here .
If you are interested in learning about the linear-time algorithms for $\textsf{2-Disjoint Shortest Paths}$ discussed in this work, you may find the exposition in chapters six and eight of my thesis easier to follow.
Instead of reading this paper, you may find the exposition in chapters six and seven of my thesis easier to follow.
arXiv Conference Proceedings Journal Publication
Instead of reading this paper, you may find the exposition in chapters six and seven of my thesis easier to follow.
ECCC Conference Proceedings Journal Publication
SODA 2022
QIP 2022
Algorithmica 2023
arXiv Conference Proceedings Journal Publication
arXiv Conference Extended Abstract A Nitter Thread Oxford-Warwick Presentation Slides LIS Natural Computation Presentation UWaterloo Solvers, ML, Logic, & Complexity Presentation FOCS Video
Instead of reading this paper, you may find the exposition in Part I of my thesis easier to follow.
If you enjoyed this paper, you may also enjoy this beautiful sequel work by Till Tantau.
arXiv Conference Proceedings SM Thesis Version Presentation
The main open problem raised by this work was resolved in this paper by Xiaoyu He and Ray Li.
Artificial Intelligence 2020 (Volume 289)
ICAPS 2019 · Runner-Up for Best Student Paper
Conference Proceedings Presentation
During high school I participated in a few math contests, and in undergrad I wrote several problems for the Caltech Harvey Mudd Math Competition and USA Math Talent Search.
Some recreational (non-research) math problems which I particularly enjoyed from this time can be found here.