Higher lower bounds for near-neighbor and further rich problems

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 646-654

  Pǎtrşcu, Mihai ^a   Thorup, Mikkel ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; LINEAR ALGEBRA; POLYNOMIALS;

APPROXIMATE SEARCH; NEAR-LINEAR SPACE; NEAR-NEIGHBOR PROBLEMS; RICHNESS METHOD;

PROBLEM SOLVING;

EID: 35449001981     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.35     Document Type: Conference Paper

References (13)

1. A. Andoni, P. Indyk, and M. Pǎtraşcu. On the optimality of the dimensionality reduction method. In Proc 47th IEEE Symposium on Foundations of Computer Science (FOCS), 2006.
2. O. Barkol and Y. Rabani. Tighter lower bounds for nearest neighbor search and related problems in the cell probe model. Journal of Computer and System Sciences, 64(4):873-896, 2002. See also STOC'00.
3. P. Beame, T. Pitassi, N. Segerlind, and A. Wigderson. A direct sum theorem for corruption and the multiparty NOF communication complexity of set disjointness. In Proc 20th IEEE Conference on Computational Complexity (CCC), pages 52-66, 2005.
4. A. Borodin, R. Ostrovsky, and Y Rabani. Lower bounds for high dimensional nearest neighbor search and related problems. In Proc 31st ACM Symposium on Theory of Computing (STOC), pages 312-321, 1999.
5. A. Chakrabarti, B. Chazelle, B. Gum, and A. Lvov. A lower bound on the complexity of approximate nearest-neighbor searching on the hamming cube. In Proc 31st ACM Symposium on Theory of Computing (STOC), pages 305-311, 1999.
6. A. Chakrabarti and O. Regev. An optimal randomised cell probe lower bound for approximate nearest neighbour searching. In Proc 45th IEEE Symposium on Foundations of Computer Science (FOCS), pages 473-482, 2004.
7. R. Cole, L.-A. Gottlieb, and M. Lewenstein. Dictionary matching and indexing with errors and don't cares. In Proc 36th ACM Symposium on Theory of Computing (STOC), pages 91-100, 2004.
8. P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proc 30th ACM Symposium on Theory of Computing (STOC), pages 604-613, 1998.
9. T. S. Jayram, S. Khot, R. Kumar, and Y. Rabani. Cell-probe lower bounds for the partial match problem. Journal of Computer and System Sciences, 69(3):435-447, 2004. See also STOC'03.
10. E. Kushilevitz, R. Ostrovsky, and Y Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM Journal on Computing, 30(2):457-474, 2000. See also STOC'98.
11. D. Liu. A strong lower bound for approximate nearest neighbor searching. Information Processing Letters, 92(1):23-29, 2004.
12. P. B. Miltersen, N. Nisan, S. Safra, and A. Wigderson. On data structures and asymmetric communication complexity. Journal of Computer and System Sciences, 57(1):37-49, 1998. See also STOC'95.
13. M. Pätraşcu and M. Thorup. Time-space trade-offs for predecessor search. In Proc 38th ACM Symposium on Theory of Computing (STOC), pages 232-240, 2006.