About

Hello! I’m a third year PhD student at Stanford University focusing on Theoretical Computer Science. I am grateful to be advised by Professors Tselil Schramm and Nima Anari.

My research interests broadly lie in CS problems related to polynomials, including both the geometry of polynomials and their applications to algorithms such as the Sum of Squares (SoS) meta-algorithm. Currently, I am working on (1) speeding up Markov Chain Monte Carlo methods and (2) unifying and robustifying algorithmic frameworks using SoS.

Before Stanford, I did my undergraduate at Carnegie Mellon University in Computer Science with an additional minor in math and an Algorithms & Complexity concentration. I was fortunate to be advised by Professor Pravesh Kothari for my senior thesis on List Decodable Covariance Estimation.