Alexandr Andoni
Welcome to my homepage. This is how I look like (sometimes):
Info about me:
I am now a postdoc at the Center for Computational
Intractability at Princeton, where my
office is 103C. I am also a visitor at IAS (office A-108) and NYU
(office "think coffee").
My research interests include: high-dimensional computational geometry, metric
embeddings, sublinear algorithms, streaming, algorithms for massive
data sets, theoretical machine learning.
In summer/fall of 2010, I
will be joining Microsoft
Research Silicon Valley.
I graduated from MIT 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].
LSH:
I maintain a page on LSH (Locality-Sensitive
Hashing). 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 Google and other 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:
Alexandr Andoni
Dept. of Computer Science,
35 Olden St., Room 103C,
Princeton, NJ 08544
Phone: 609 258 0419
Email: 