Alexandr Andoni
Alexandr Andoni
Associate Professor, Columbia University
Verified email at mit.edu - Homepage
Title
Cited by
Cited by
Year
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
A Andoni, P Indyk
Foundations of Computer Science, 2006. FOCS'06. 47th Annual IEEE Symposium …, 2006
28182006
Practical and optimal LSH for angular distance
A Andoni, P Indyk, T Laarhoven, I Razenshteyn, L Schmidt
arXiv preprint arXiv:1509.02897, 2015
3662015
Optimal data-dependent hashing for approximate near neighbors
A Andoni, I Razenshteyn
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
2522015
Beyond locality-sensitive hashing
A Andoni, P Indyk, HL Nguyễn, I Razenshteyn
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
1952014
Learning polynomials with neural networks
A Andoni, R Panigrahy, G Valiant, L Zhang
International conference on machine learning, 1908-1916, 2014
1562014
Parallel algorithms for geometric graph problems
A Andoni, A Nikolov, K Onak, G Yaroslavtsev
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
1452014
Nearest Neighbor Search: the Old, the New, and the Impossible
A Andoni
Massachusetts Institute of Technology, 2009
1332009
Optimal hashing-based time-space trade-offs for approximate near neighbors
A Andoni, T Laarhoven, I Razenshteyn, E Waingarten
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
1222017
Testing k-wise and almost k-wise independence
N Alon, A Andoni, T Kaufman, K Matulef, R Rubinfeld, N Xie
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
1212007
E 2 LSH0. 1 User Manual
A Andoni, P Indyk
June, 2005
117*2005
Approximating edit distance in near-linear time
A Andoni, K Onak
SIAM Journal on Computing 41 (6), 1635-1648, 2012
1112012
Evaluating the “small scope hypothesis”
A Andoni, D Daniliuc, S Khurshid, D Marinov
In Popl 2, 2003
1102003
Polylogarithmic approximation for edit distance and the asymmetric query complexity
A Andoni, R Krauthgamer, K Onak
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 377-386, 2010
1092010
Streaming algorithms via precision sampling
A Andoni, R Krauthgamer, K Onak
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 363-372, 2011
1062011
On the optimality of the dimensionality reduction method
A Andoni, P Indyk, M Patrascu
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006
992006
Earth mover distance over high-dimensional spaces.
A Andoni, P Indyk, R Krauthgamer
SODA 8, 343-352, 2008
872008
An evaluation of exhaustive testing for data structures
D Marinov, A Andoni, D Daniliuc, S Khurshid, M Rinard
Technical Report MIT-LCS-TR-921, MIT CSAIL, Cambridge, MA, 2003
752003
Efficient sketches for earth-mover distance, with applications
A Andoni, K Do Ba, P Indyk, D Woodruff
2009 50th Annual IEEE Symposium on Foundations of Computer Science, 324-330, 2009
712009
Parallel graph connectivity in log diameter rounds
A Andoni, Z Song, C Stein, Z Wang, P Zhong
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
672018
Approximate nearest neighbor search in high dimensions
A Andoni, P Indyk, I Razenshteyn
Proceedings of the International Congress of Mathematicians: Rio de Janeiro …, 2018
662018
The system can't perform the operation now. Try again later.
Articles 1–20