Alexandr Andoni
Affiliations: | Computer Science | Columbia University, New York, NY |
Area:
Algorithmic Foundations of Massive Data, including Sublinear Algorithms, High-dimensional Geometry, Theoretical Machine LearningGoogle:
"Alexandr Andoni"
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Andoni A, Krauthgamer R, Razenshteyn I. (2015) Sketching and embedding are equivalent for norms Proceedings of the Annual Acm Symposium On Theory of Computing. 14: 479-488 |
Andoni A, Nikolov A, Onak K, et al. (2014) Parallel algorithms for geometric graph problems Proceedings of the Annual Acm Symposium On Theory of Computing. 574-583 |
Abdullah A, Andoni A, Kannan R, et al. (2014) Spectral approaches to nearest neighbor search Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 581-590 |
Andoni A, Nguyên HL, Polyanskiy Y, et al. (2013) 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 |
Andoni A, Krauthgamer R. (2012) The smoothed complexity of edit distance Acm Transactions On Algorithms. 8 |
Andoni A, Onak K. (2012) Approximating edit distance in near-linear time? Siam Journal On Computing. 41: 1635-1648 |
Andoni A, Krauthgamer R. (2010) The computational hardness of estimating edit distance Siam Journal On Computing. 39: 2398-2429 |
Andoni A, Nguyen HL. (2010) Near-optimal sublinear time algorithms for Ulam distance Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 76-86 |
Andoni A, Ba KD, Indyk P, et al. (2009) Efficient sketches for Earth-Mover Distance, with applications Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 324-330 |
Andoni A, Indyk P, Krauthgamer R, et al. (2009) Approximate line nearest neighbor in high dimensions Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 293-301 |