I am a fourth-year undergraduate student majoring in mathematics and computer science at UC Berkeley, where I am fortunate to be advised by Prasad Raghavendra. Previously, I also had the pleasure of working with Siu On Chan at CUHK. I am graduating in May, 2020 and I am currently applying for PhD Program in Theoretical Computer Science in this cycle.
I am interested in theoretical computer science in general. Recently, I have spent most of my time thinking about convex relaxation hierarchies and their limitations, as well as the intersection of tcs and statistical physics. More broadly, I am interested in hardness of approximation, average-case complexity, random matrix theory and proof complexity.Papers:
with Sidhanth Mohanty, and Prasad Raghavendra.
Teaching AssistantCS 174: Randomized Algorithms. (Spring, Fall 2019).
Head Teaching Assistant