Experience

Sign in to view more

Education

Sign in to view more

Bio

I am an associate professor at Columbia University, and member of the Data Science Institute. I have a broad interest in algorithmic foundations of massive data. Some particular interests include sublinear algorithms (streaming and property testing), high-dimensional computational geometry, metric embeddings, and machine learning.

I graduated from MIT in 2009, under the supervision of Prof. Piotr Indyk. My PhD thesis is on the "Nearest Neighbor Search: the Old, the New, and the Impossible". In 2009--2010, I was a postdoc at the Center for Computational Intractability at Princeton, and a visitor at NYU and IAS. I was a researcher at Microsoft Research Silicon Valley lab, from 2010 until its closure in 2014. Afterwards, I was a visiting scientist at the Simons Institute for the Theory of Computing at UC Berkeley.

I graduated from MIT in 2009, under the supervision of Prof. Piotr Indyk. My PhD thesis is on the "Nearest Neighbor Search: the Old, the New, and the Impossible". In 2009--2010, I was a postdoc at the Center for Computational Intractability at Princeton, and a visitor at NYU and IAS. I was a researcher at Microsoft Research Silicon Valley lab, from 2010 until its closure in 2014. Afterwards, I was a visiting scientist at the Simons Institute for the Theory of Computing at UC Berkeley.