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 .
If you enjoyed this paper, you may also enjoy this beautiful sequel work by Till Tantau.
The main open problem raised by this work was resolved in this paper by Xiaoyu He and Ray Li.
ICAPS 2019 · Runner-Up for Best Student Paper