I am a fourth-year PhD candidate studying Theoretical Computer Science at MIT, grateful to be advised by both Virginia Vassilevska Williams and Ryan Williams.
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 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 for introducing me to research, Mohamed Omar for helping foster my interest in combinatorics, Jim Boerkoel for showing me how fascinating computer science research could be, and Ran Libeskind-Hadas for sparking my interest in theoretical computer science.
You can contact me using the email listed here .
ECCC Conference Proceedings Journal Publication
arXiv Conference Proceedings Journal Publication
arXiv Conference Extended Abstract A Twitter Thread Oxford-Warwick Presentation Slides LIS Natural Computation Presentation UWaterloo Solvers, ML, Logic, & Complexity Presentation FOCS Video
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
Optimization Letters 2015 (Volume 9)
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.