dblp.uni-trier.dewww.uni-trier.de

Alexandr Andoni

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
16EEAlexandr Andoni, Piotr Indyk, Robert Krauthgamer, Huy L. Nguyen: Approximate line nearest neighbor in high dimensions. SODA 2009: 293-301
15EEAlexandr Andoni, Piotr Indyk, Robert Krauthgamer: Overcoming the l1 non-embeddability barrier: algorithms for product metrics. SODA 2009: 865-874
2008
14EEAlexandr Andoni, Dorian Croitoru, Mihai Patrascu: Hardness of Nearest Neighbor under L-infinity. FOCS 2008: 424-433
13EEAlexandr Andoni, Robert Krauthgamer: The Smoothed Complexity of Edit Distance. ICALP (1) 2008: 357-369
12EEAlexandr 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
11EEAlexandr Andoni, Piotr Indyk, Robert Krauthgamer: Earth mover distance over high-dimensional spaces. SODA 2008: 343-352
10EEAlexandr Andoni, Andrew McGregor, Krzysztof Onak, Rina Panigrahy: Better Bounds for Frequency Moments in Random-Order Streams CoRR abs/0808.2222: (2008)
9EEAlexandr Andoni, Piotr Indyk: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1): 117-122 (2008)
2007
8EEAlexandr Andoni, Robert Krauthgamer: The Computational Hardness of Estimating Edit Distance [Extended Abstract]. FOCS 2007: 724-734
7EENoga Alon, Alexandr Andoni, Tali Kaufman, Kevin Matulef, Ronitt Rubinfeld, Ning Xie: Testing k-wise and almost k-wise independence. STOC 2007: 496-505
6EEAlexandr Andoni, Piotr Indyk, Robert Krauthgamer: Earth Mover Distance over High-Dimensional Spaces. Electronic Colloquium on Computational Complexity (ECCC) 14(048): (2007)
2006
5EEAlexandr Andoni, Piotr Indyk, Mihai Patrascu: On the Optimality of the Dimensionality Reduction Method. FOCS 2006: 449-458
4EEAlexandr Andoni, Piotr Indyk: Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions. FOCS 2006: 459-468
3EEAlexandr Andoni, Piotr Indyk: Efficient algorithms for substring near neighbor problem. SODA 2006: 1203-1212
2005
2EEAlexandr Andoni, Jessica Staddon: Graceful service degradation (or, how to know your payment is late). ACM Conference on Electronic Commerce 2005: 9-18
2003
1EEAlexandr Andoni, Michel Deza, Anupam Gupta, Piotr Indyk, Sofya Raskhodnikova: Lower bounds for embedding edit distance into normed spaces. SODA 2003: 523-526

Coauthor Index

1Noga Alon [7]
2Dorian Croitoru [14]
3Michel Deza [1]
4Ronald Fagin [12]
5Anupam Gupta [1]
6Piotr Indyk [1] [3] [4] [5] [6] [9] [11] [15] [16]
7Tali Kaufman [7]
8Robert Krauthgamer [6] [8] [11] [13] [15] [16]
9Ravi Kumar (S. Ravi Kumar) [12]
10Kevin Matulef [7]
11Andrew McGregor [10]
12Huy L. Nguyen [16]
13Krzysztof Onak [10]
14Rina Panigrahy [10]
15Mihai Patrascu [5] [12] [14]
16Sofya Raskhodnikova [1]
17Ronitt Rubinfeld [7]
18D. Sivakumar [12]
19Jessica Staddon [2]
20Ning Xie [7]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)