Alexandr Andoni
Alexandr Andoni
Associate Professor, Columbia University
Email verificata su mit.edu - Home page
Titolo
Citata da
Citata da
Anno
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
24762006
Practical and optimal LSH for angular distance
A Andoni, P Indyk, T Laarhoven, I Razenshteyn, L Schmidt
Advances in neural information processing systems, 1225-1233, 2015
2582015
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
2052015
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
1542014
Nearest Neighbor Search: the Old, the New, and the Impossible
A Andoni
Massachusetts Institute of Technology, 2009
1202009
Learning polynomials with neural networks
A Andoni, R Panigrahy, G Valiant, L Zhang
International conference on machine learning, 1908-1916, 2014
1192014
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
1092014
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
1062007
E 2 LSH0. 1 User Manual
A Andoni, P Indyk
June, 2005
104*2005
Evaluating the “small scope hypothesis”
A Andoni, D Daniliuc, S Khurshid, D Marinov
In Popl 2, 2003
962003
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
912017
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
902006
Approximating edit distance in near-linear time
A Andoni, K Onak
SIAM Journal on Computing 41 (6), 1635-1648, 2012
892012
Streaming algorithms via precision sampling
A Andoni, R Krauthgamer, K Onak
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 363-372, 2011
87*2011
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
872010
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
692003
Earth mover distance over high-dimensional spaces.
A Andoni, P Indyk, R Krauthgamer
SODA 8, 343-352, 2008
632008
Efficient algorithms for substring near neighbor problem
A Andoni, P Indyk
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006
592006
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
582009
Lower bounds for embedding edit distance into normed spaces
A Andoni, M Deza, A Gupta, P Indyk, S Raskhodnikova
Carnegie Mellon University, 2003
572003
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20