Welcome to my homepage. This is how I look like (sometimes):
Info about me:
I am a researcher at Microsoft
Research Silicon Valley.
My research interests include: high-dimensional computational geometry, metric
embeddings, sublinear algorithms, streaming, algorithms for massive
data sets, theoretical machine learning.
I graduated from MIT in
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
Intractability at Princeton, and a
Talks and slides:
Talk on "Nearest Neighbor Search in
High-Dimensional Spaces" at
the 36th International Symposium
Foundations of Computer Science (MFCS), 2011, and
older version (pdf
on Barriers in Computational Complexity II, 2010.
Program Committee of FOCS'13.
Co-organizer (together with Erik Demaine, Piotr Indyk, and Mikkel
Thorup) of the "Data Structures (in memory of Mihai Pătraşcu)"
workshop at FOCS'12.
Program Committee of MASSIVE'12.
Program Committee of APPROX'12.
Program Committee of ESA-B'12.
Program Committee of CPM'11.
(together with Tim Austin
and Assaf Naor) of the
on embeddings as part of
Analysis programme at the Isaac Newton Institute for
Mathematical Sciences, Cambridge, UK.
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
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 :).
Microsoft Research Silicon Valley, 6/1171
1065 La Avenida st.
Mountain View, CA 94043