Alexandr Andoni is an Associate Professor in the Department of Computer Science with a broad interest in algorithmic foundations of massive data. His particular research interests include sublinear algorithms (streaming and property testing), high-dimensional computational geometry, metric embeddings, and machine learning.

Professor Andoni graduated from MIT in 2009, under the supervision of Professor Piotr Indyk. His Ph.D. thesis was on the “Nearest Neighbor Search: the Old, the New, and the Impossible”. In 2009–2010, he was a postdoc at the Center for Computational Intractability at Princeton, and a visitor at NYU and IAS. He was also a researcher at Microsoft Research Silicon Valley lab, from 2010 until its closure in 2014. Afterwards, he was a visiting scientist at the Simons Institute for the Theory of Computing at UC Berkeley.