Alexandr Andoni's research focuses on advancing algorithmic foundations of massive data, with interests revolving around sublinear algorithms, high-dimensional geometry, and theoretical machine learning. Andoni is an associate professor at the Columbia University and a member of the Columbia's Data Science Institute. He graduated from MIT in 2009, with a PhD thesis on Nearest Neighbor Search, under the supervision of Piotr Indyk. Following graduation, he was a postdoc at the Center for Computational Intractability at Princeton, as well as a visitor at NYU and IAS. Andoni then joined Microsoft Research Silicon Valley, where he was a researcher until 2014. Afterwards, Alexandr Andoni was a visiting scientist at the Simons Institute for the Theory of Computing at UC Berkeley.
- Bridging Continuous and Discrete Optimization, Fall 2017. Workshop Organizer.
- Cryptography, Summer 2015. Visiting Scientist.
- Information Theory, Spring 2015. Visiting Scientist.
- Algorithmic Spectral Graph Theory, Fall 2014. Visiting Scientist.
- Theoretical Foundations of Big Data Analysis, Fall 2013. Visiting Scientist.