I am an undergraduate at Stony Brook University interested in theoretical computer science, especially algorithms, complexity theory, and combinatorics. I expect to graduate in May 2027.
I am particularly interested in approximation and graph algorithms, complexity theory, and discrete problems where a simple combinatorial question leads to something algorithmic.
I also maintain a small interactive complexity zoo.
Research
-
Finite Divisibility Runs Between Generalized Fibonacci and Tribonacci Sequences.
-
Deletion and Palette Size in the Domatic Number Game.
-
Boolean Derivative Certificates and Maximal ANF Terms.
More research and presentations →
Recent
- 2026Boolean Derivative Certificates and Maximal ANF Terms appeared as ECCC TR26-083.
- 2026Finite Divisibility Runs Between Generalized Fibonacci and Tribonacci Sequences was published in Integers.
- 2026Deletion and Palette Size in the Domatic Number Game was published in Ars Combinatoria.
About
Outside of computer science, I enjoy playing the violin and piano, listening to classical music (especially Rachmaninov), cooking and trying new foods, and following astronomy.