The SCEAS System
| |||||||

## Search the dblp DataBase
Alexandr Andoni:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Alexandr Andoni, Piotr Indyk
**Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions.**[Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:459-468 [Conf] - Alexandr Andoni, Piotr Indyk, Mihai Patrascu
**On the Optimality of the Dimensionality Reduction Method.**[Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:449-458 [Conf] - Alexandr Andoni, Jessica Staddon
**Graceful service degradation (or, how to know your payment is late).**[Citation Graph (0, 0)][DBLP] ACM Conference on Electronic Commerce, 2005, pp:9-18 [Conf] - Alexandr Andoni, Michel Deza, Anupam Gupta, Piotr Indyk, Sofya Raskhodnikova
**Lower bounds for embedding edit distance into normed spaces.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:523-526 [Conf] - Alexandr Andoni, Piotr Indyk
**Efficient algorithms for substring near neighbor problem.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:1203-1212 [Conf] - Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Matulef, Ronitt Rubinfeld, Ning Xie
**Testing k-wise and almost k-wise independence.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:496-505 [Conf] **The Computational Hardness of Estimating Edit Distance [Extended Abstract].**[Citation Graph (, )][DBLP]**Hardness of Nearest Neighbor under L-infinity.**[Citation Graph (, )][DBLP]**Efficient Sketches for Earth-Mover Distance, with Applications.**[Citation Graph (, )][DBLP]**The Smoothed Complexity of Edit Distance.**[Citation Graph (, )][DBLP]**External Sampling.**[Citation Graph (, )][DBLP]**Corrigendum to "efficient similarity search and classification via rank aggregation" by Ronald Fagin, Ravi Kumar and D. Sivakumar (proc. SIGMOD'03).**[Citation Graph (, )][DBLP]**Earth mover distance over high-dimensional spaces.**[Citation Graph (, )][DBLP]**Approximate line nearest neighbor in high dimensions.**[Citation Graph (, )][DBLP]**Overcoming the**[Citation Graph (, )][DBLP]*l*_{1}non-embeddability barrier: algorithms for product metrics.**Lower Bounds for Edit Distance and Product Metrics via Poincaré-Type Inequalities.**[Citation Graph (, )][DBLP]**Near-Optimal Sublinear Time Algorithms for Ulam Distance.**[Citation Graph (, )][DBLP]**Approximating edit distance in near-linear time.**[Citation Graph (, )][DBLP]**Global Alignment of Molecular Sequences via Ancestral State Reconstruction.**[Citation Graph (, )][DBLP]**Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions.**[Citation Graph (, )][DBLP]**Better Bounds for Frequency Moments in Random-Order Streams**[Citation Graph (, )][DBLP]**Global Alignment of Molecular Sequences via Ancestral State Reconstruction**[Citation Graph (, )][DBLP]**Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity**[Citation Graph (, )][DBLP]**Earth Mover Distance over High-Dimensional Spaces.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |