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