I am a PhD student at MIT
in the computer science (EECS)
department, with an interest in parallel graph algorithms. My advisor is Prof.
I graduated from Princeton
with an A.B. in mathematics, with highest honors. I worked
with Prof. Maria Chudnovsky
for my senior thesis, and with
Dr. Jérémie Lumbroso
for my junior
My current research focuses on designing scalable graph mining and hypergraph
processing algorithms, with strong theoretical
guarantees and efficient implementations under unified frameworks.
In the past, I have also been interested in structural
graph theory and analytic combinatorics.