Sotabase

Career

· Associate Professor, Columbia University2015–
· Visiting Researcher, Simons Institute for the Theory of Computing, UC Berkeley2014–2015
· Researcher, Microsoft Research Silicon Valley2010–2014
· Postdoctoral Researcher, Center for Computational Intractability, Princeton University2009–2010
· PhD in Computer Science, Massachusetts Institute of Technology (MIT)2005–2009
· Master of Engineering in Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT)2004–2005
· BS in Computer Science and Engineering & BS in Mathematics, Massachusetts Institute of Technology (MIT)2001–2004
· Undergraduate Studies, Politehnica University of Bucharest1999–2001

Publications (117)

Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
IEEE Annual Symposium on Foundations of Computer Science · 2006
2,576
cited
Practical and Optimal LSH for Angular Distance
Neural Information Processing Systems · 2015
526
cited
Optimal Data-Dependent Hashing for Approximate Near Neighbors
Symposium on the Theory of Computing · 2015
309
cited
Beyond Locality-Sensitive Hashing
ACM-SIAM Symposium on Discrete Algorithms · 2013
201
cited
Parallel algorithms for geometric graph problems
Symposium on the Theory of Computing · 2013
188
cited
Approximate Nearest Neighbor Search in High Dimensions
International Congress of Mathematicans · 2018
179
cited
Learning Polynomials with Neural Networks
International Conference on Machine Learning · 2014
163
cited
Testing k-wise and almost k-wise independence
Symposium on the Theory of Computing · 2007
141
cited
Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors
ACM-SIAM Symposium on Discrete Algorithms · 2016
135
cited
Earth mover distance over high-dimensional spaces
ACM-SIAM Symposium on Discrete Algorithms · 2008
128
cited
Nearest neighbor search : the old, the new, and the impossible
2009
123
cited
Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity
IEEE Annual Symposium on Foundations of Computer Science · 2010
120
cited
Approximating edit distance in near-linear time
Symposium on the Theory of Computing · 2009
118
cited
Streaming Algorithms via Precision Sampling
IEEE Annual Symposium on Foundations of Computer Science · 2010
110
cited
Information Science
Nature · 1971
108
cited
Parallel Graph Connectivity in Log Diameter Rounds
IEEE Annual Symposium on Foundations of Computer Science · 2018
104
cited
Evaluating the “ Small Scope Hypothesis ”
2002
99
cited
Efficient Sketches for Earth-Mover Distance, with Applications
2009 50th Annual IEEE Symposium on Foundations of Computer Science · 2009
86
cited
On the Optimality of the Dimensionality Reduction Method
IEEE Annual Symposium on Foundations of Computer Science · 2006
85
cited
On Sketching Quadratic Forms
Information Technology Convergence and Services · 2015
74
cited
Sotabase
Alexandr Andoni | Researcher Profile | Sotabase | Sotabase