| 2013 | ||
|---|---|---|
| c28 | Alexandr Andoni, Piotr Indyk, Dina Katabi, Haitham Hassanieh: Shift Finding in Sub-Linear Time. SODA 2013: 457-465 | |
| c27 | Alexandr Andoni, Huy L. Nguyen: Eigenvalues of a matrix in the streaming model. SODA 2013: 1729-1737 | |
| 2012 | ||
| j4 | Alexandr Andoni, Krzysztof Onak: Approximating Edit Distance in Near-Linear Time. SIAM J. Comput. 41(6): 1635-1648 (2012) | |
| j3 | Alexandr Andoni, Robert Krauthgamer: The smoothed complexity of edit distance. ACM Transactions on Algorithms 8(4): 44 (2012) | |
| c26 | ||
| 2011 | ||
| c25 | Alexandr Andoni, Moses Charikar, Ofer Neiman, Huy L. Nguyen: Near Linear Lower Bound for Dimension Reduction in L1. FOCS 2011: 315-323 | |
| c24 | Alexandr Andoni, Robert Krauthgamer, Krzysztof Onak: Streaming Algorithms via Precision Sampling. FOCS 2011: 363-372 | |
| c23 | ||
| i6 | Alexandr Andoni, Krzysztof Onak: Approximating Edit Distance in Near-Linear Time. CoRR abs/1109.5635 (2011) | |
| 2010 | ||
| j2 | Alexandr Andoni, Robert Krauthgamer: The Computational Hardness of Estimating Edit Distance. SIAM J. Comput. 39(6): 2398-2429 (2010) | |
| c22 | Alexandr Andoni, Robert Krauthgamer, Krzysztof Onak: Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity. FOCS 2010: 377-386 | |
| c21 | Alexandr Andoni, Constantinos Daskalakis, Avinatan Hassidim, Sébastien Roch: Global Alignment of Molecular Sequences via Ancestral State Reconstruction. ICS 2010: 358-369 | |
| c20 | Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld: Sublinear Algorithms in the External Memory Model. Property Testing 2010: 240-243 | |
| c19 | Alexandr Andoni, Robert Krauthgamer, Krzysztof Onak: Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity. Property Testing 2010: 244-252 | |
| c18 | Alexandr Andoni, Huy L. Nguyen: Near-Optimal Sublinear Time Algorithms for Ulam Distance. SODA 2010: 76-86 | |
| c17 | Alexandr Andoni, T. S. Jayram, Mihai Patrascu: Lower Bounds for Edit Distance and Product Metrics via Poincaré-Type Inequalities. SODA 2010: 184-192 | |
| i5 | Alexandr Andoni, Robert Krauthgamer, Krzysztof Onak: Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity. CoRR abs/1005.4033 (2010) | |
| i4 | Alexandr Andoni, Robert Krauthgamer, Krzysztof Onak: Streaming Algorithms from Precision Sampling. CoRR abs/1011.1263 (2010) | |
| 2009 | ||
| c16 | Alexandr Andoni, Khanh Do Ba, Piotr Indyk, David P. Woodruff: Efficient Sketches for Earth-Mover Distance, with Applications. FOCS 2009: 324-330 | |
| c15 | Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld: External Sampling. ICALP (1) 2009: 83-94 | |
| c14 | Alexandr Andoni, Piotr Indyk, Robert Krauthgamer, Huy L. Nguyen: Approximate line nearest neighbor in high dimensions. SODA 2009: 293-301 | |
| c13 | Alexandr Andoni, Piotr Indyk, Robert Krauthgamer: Overcoming the l1 non-embeddability barrier: algorithms for product metrics. SODA 2009: 865-874 | |
| c12 | Alexandr Andoni, Krzysztof Onak: Approximating edit distance in near-linear time. STOC 2009: 199-204 | |
| i3 | Alexandr Andoni, Constantinos Daskalakis, Avinatan Hassidim, Sébastien Roch: Global Alignment of Molecular Sequences via Ancestral State Reconstruction. CoRR abs/0912.2577 (2009) | |
| 2008 | ||
| j1 | Alexandr Andoni, Piotr Indyk: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1): 117-122 (2008) | |
| c11 | Alexandr Andoni, Dorian Croitoru, Mihai Patrascu: Hardness of Nearest Neighbor under L-infinity. FOCS 2008: 424-433 | |
| c10 | Alexandr Andoni, Robert Krauthgamer: The Smoothed Complexity of Edit Distance. ICALP (1) 2008: 357-369 | |
| c9 | Alexandr Andoni, Ronald Fagin, Ravi Kumar, Mihai Patrascu, D. Sivakumar: Corrigendum to "efficient similarity search and classification via rank aggregation" by Ronald Fagin, Ravi Kumar and D. Sivakumar (proc. SIGMOD'03). SIGMOD Conference 2008: 1375-1376 | |
| c8 | Alexandr Andoni, Piotr Indyk, Robert Krauthgamer: Earth mover distance over high-dimensional spaces. SODA 2008: 343-352 | |
| i2 | Alexandr Andoni, Andrew McGregor, Krzysztof Onak, Rina Panigrahy: Better Bounds for Frequency Moments in Random-Order Streams. CoRR abs/0808.2222 (2008) | |
| 2007 | ||
| c7 | Alexandr Andoni, Robert Krauthgamer: The Computational Hardness of Estimating Edit Distance [Extended Abstract]. FOCS 2007: 724-734 | |
| c6 | Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Matulef, Ronitt Rubinfeld, Ning Xie: Testing k-wise and almost k-wise independence. STOC 2007: 496-505 | |
| i1 | Alexandr Andoni, Piotr Indyk, Robert Krauthgamer: Earth Mover Distance over High-Dimensional Spaces. Electronic Colloquium on Computational Complexity (ECCC) 14(048) (2007) | |
| 2006 | ||
| c5 | Alexandr Andoni, Piotr Indyk, Mihai Patrascu: On the Optimality of the Dimensionality Reduction Method. FOCS 2006: 449-458 | |
| c4 | Alexandr Andoni, Piotr Indyk: Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions. FOCS 2006: 459-468 | |
| c3 | Alexandr Andoni, Piotr Indyk: Efficient algorithms for substring near neighbor problem. SODA 2006: 1203-1212 | |
| 2005 | ||
| c2 | Alexandr Andoni, Jessica Staddon: Graceful service degradation (or, how to know your payment is late). ACM Conference on Electronic Commerce 2005: 9-18 | |
| 2003 | ||
| c1 | Alexandr Andoni, Michel Deza, Anupam Gupta, Piotr Indyk, Sofya Raskhodnikova: Lower bounds for embedding edit distance into normed spaces. SODA 2003: 523-526 | |
Data released under the ODC-BY 1.0 license — See also our legal information page