I am a first year PhD student in theoretical computer science at Carnegie Mellon University, where I am advised by David Woodruff. I recently graduated from Brown University, where I concentrated in mathematics and computer science.

My research interests are primarily in randomized algorithms, specifically streaming and sketching algorithms for problems in big-data. In general, I like to think about problems regarding dimensionality reduction -- i.e. to what extent can we compress and distill the significant bits of some enourmous, chaotic data-set. Additionally, I am interested in communication complexity, machine learning, optimization, and fine grained complexity.