☰

Alexandr Andoni - Publications

Affiliations: 
Computer Science Columbia University, New York, NY 
Area:
Algorithmic Foundations of Massive Data, including Sublinear Algorithms, High-dimensional Geometry, Theoretical Machine Learning
Tree Info Similar researchers PubMed Report error

13 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2015 Andoni A, Krauthgamer R, Razenshteyn I. Sketching and embedding are equivalent for norms Proceedings of the Annual Acm Symposium On Theory of Computing. 14: 479-488. DOI: 10.1137/15M1017958  0.3
2014 Andoni A, Nikolov A, Onak K, Yaroslavtsev G. Parallel algorithms for geometric graph problems Proceedings of the Annual Acm Symposium On Theory of Computing. 574-583. DOI: 10.1145/2591796.2591805  0.357
2014 Abdullah A, Andoni A, Kannan R, Krauthgamer R. Spectral approaches to nearest neighbor search Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 581-590. DOI: 10.1109/FOCS.2014.68  0.31
2013 Andoni A, Nguyên HL, Polyanskiy Y, Wu Y. Tight lower bound for linear sketches of moments Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7965: 25-32. DOI: 10.1007/978-3-642-39206-1_3  0.364
2012 Andoni A, Krauthgamer R. The smoothed complexity of edit distance Acm Transactions On Algorithms. 8. DOI: 10.1145/2344422.2344434  0.386
2012 Andoni A, Onak K. Approximating edit distance in near-linear time? Siam Journal On Computing. 41: 1635-1648. DOI: 10.1137/090767182  0.325
2010 Andoni A, Krauthgamer R. The computational hardness of estimating edit distance Siam Journal On Computing. 39: 2398-2429. DOI: 10.1137/080716530  0.359
2010 Andoni A, Nguyen HL. Near-optimal sublinear time algorithms for Ulam distance Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 76-86.  0.326
2009 Andoni A, Ba KD, Indyk P, Woodruff D. Efficient sketches for Earth-Mover Distance, with applications Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 324-330. DOI: 10.1109/FOCS.2009.25  0.386
2009 Andoni A, Indyk P, Krauthgamer R, Nguyen HL. Approximate line nearest neighbor in high dimensions Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 293-301.  0.329
2008 Andoni A, Indyk P. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions Communications of the Acm. 51: 117-122. DOI: 10.1145/1327452.1327494  0.304
2008 Andoni A, Indyk P, Krauthgamer R. Earth Mover Distance over high-dimensional spaces Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 343-352.  0.355
2006 Andoni A, Indyk P, Pǎtraşcu M. On the optimality of the dimensionality reduction method Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 449-458. DOI: 10.1109/FOCS.2006.56  0.359
Show low-probability matches.