I am broadly 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, where I was fortunate to have several excellent mentors. In particular, I am indebted to 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 complexity theory.
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
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. Every two weeks I will post a recreational (non-research) math problem which I encountered during this time (and particularly enjoyed) below.
Convergence Only on Primes
Does there exist an infinite sequence of complex numbers $a_1, a_2, \dots$ such that for any positive integer $p$, the sum
converges if and only if $p$ is prime?
A new problem will be posted here on December 17th, 2022.
Previously posted problems can be found here.