Alexandr Andoni

Info about me:

I am a computer scientist, with 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.

Currently, I am 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" [.pdf, .ps]. 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.


CV (short bio)

Former interns:
Lectures and talks:

Professional Service:


I maintain a page on Locality-Sensitive Hashing (LSH). LSH is a practical algorithm for approximate nearest neighbor problem (in high dimensions).

Other (i.e., random stuff):

ACM ICPC: I used to be one of the coaches for the MIT's team for ACM International Collegiate Programming Contest.

AntiChess: Play my AntiChess :) (a 6.170 class project, joint with Cristian Cadar and Tudor Leu). Warning: the rendering might be suboptimal (different browsers tend to diplay the board sligthly differently). If you find 3min too little, you can change the time in the menus ('Options->Change player options').

A paranthesis that will hopefully help search engines better index my webpage. Alternative spellings of my name are: Alexandru Andoni (in Romanian, my normal name, although not the official one due to some hard-to-explain bureaucracy), Alexander Andoni ("anglified" version), and Alex Andoni (simplified version :).

Contact Info: