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
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
I was a researcher at Microsoft
Research Silicon Valley lab, from 2010 until its closure in 2014.
CV (short bio)
Lectures and talks:
Algorithms and Applications 3rd edition (summer school at the
International school of Mathematics "Guido
Stampacchia"): Sampling in Graphs: cut sparsifiers,
Sampling in Graphs: node sparsifiers.
Summer School on Hashing: Theory and Practice (2014, University of
Copenhagen): Dimension Reductions,
Locality Sensitive Hashing.
Boot Camp (@ Simons Institute for Theory of
Computing), Lectures on "Algorithmic High Dimensional Geometry": Lecture 1
and references from the lectures.
School on ALgorithms for MAssive
DAta (ALMADA'13) lectures:
Lecture 1 (NNS),
Lecture 2 (dimension reduction and NNS),
Lecture 3 (streaming),
Lecture 4 (parallel algorithms).
MADALGO Center for Massive Data
Algorithmics and CTIC Summer School on
High-Dimensional Geometric Computing
1, Lecture 2, Lecture 3.
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: MASSIVE'15, RANDOM'15, SODA'15, FOCS'13, MASSIVE'12, APPROX'12,
ESA-B'12 (experimental track), STOC'11, CPM'11, RANDOM'10.
of the Bertinoro
Workshop on Sublinear Algorithms 2014 (together with Piotr
Indyk, Robert Krauthgamer, and Sofya Raskhodnikova).
of the "Data Structures (in memory of Mihai Pătraşcu)"
workshop at FOCS'12
(together with Erik Demaine, Piotr Indyk, and Mikkel
on embeddings as part of
Analysis programme at the Isaac Newton Institute for
Mathematical Sciences, Cambridge, UK (together with Tim Austin
and Assaf Naor).
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
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 :).