Cell-probe lower bounds for the partial match problem

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 667-672

  Jayram, T S ^a   Khot, Subhash ^b   Kumar, Ravi ^a   Rabani, Yuval ^c  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b Princeton University   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Algorithms; Theory

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; QUERY LANGUAGES; SET THEORY;

LOWER BOUNDS;

DATABASE SYSTEMS;

EID: 0038107511     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780637.780639     Document Type: Conference Paper

References (20)

1. M. Ajtai. A lower bound for finding predecessors in Yao's cell probe model. Combinatorial, 8:235-247, 1988.
2. O. Barkol and Y. Rabani. Tight bounds for nearest neighbor search and related problems in the cell probe model. In Proc. 32nd Annual ACM Symposium on the Theory of Computing, pages 388-396, 2000.
3. P. Beame and E. Vee. Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems. In Proc. 34th Annual ACM Symposium on the Theory of Computing, pages 688-697, 2002.
4. A. Borodin, R. Ostrovsky, and Y. Rabani. Lower bounds for high dimensional nearest neighbor search and related problems. In Proc. 31st Annual ACM Symposium on the Theory of Computing, 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 Annual ACM Symposium on the Theory of Computing, pages 305-311, 1999.
6. M. Charikar, P. Indyk, and R. Panigrahy. New algorithms for subset query, partial match, orthogonal range searching, and related problems. In Proc. 29th International Colloquium on Algorithms, Logic, and Programming, pages 451-462, 2002.
7. B. Chazelle. The Discrepancy Method: Randomness and Complexity. Cambridge University Press, 2000.
8. ∞norm. J. of Computer and System Sciences, 63(4):627-638, 2001.
9. P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proc. 30th Annual ACM Symposium on the Theory of Computing, pages 604-613, 1998.
10. J. Kleinberg. Two algorithms for nearest-neighbor search in high dimensions. In Proc. 29th Annual ACM Symposium on the Theory of Computing, pages 599-608, 1997.
11. D. Knuth. The Art of Computer Programming: Sorting and Searching. Addison-Wesley, 1973.
12. E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM J. on Computing, 30(2):451-474, 2000.
13. S. Meiser. Point location in arrangement of hyperplanes. Information and Computation, 106(2):286-303, 1993.
14. P. B. Miltersen. Lower bounds for union-split-find related problems on random access machines. In Proc. 26th Annual ACM Symposium on the Theory of Computing, pages 625-634, 1994.
15. P.B. Miltersen. Cell probe complexity - a survey. In Pre-Conference Workshop on Advances in Data Structures at the 19th Conference on Foundations of Software Technology and Theoretical Computer Science, 1999.
16. P. B. Miltersen, N. Nisan, S. Safra, and A. Wigderson. On data structures and asymmetric communication complexity. J. of Computer and System Sciences, 57(l):37-49, 1998.
17. N. Nisan and A. Wigderson. Hardness vs. randomness. J. of Computer and System Sciences, 49(2): 149-167, 1994
18. R. Rivest. Analysis of Associative Retrieval Algorithms. PhD thesis, Stanford University, 1974.
19. R. Rivest. Partial match retrieval algorithms. SIAM J. on Computing, 5(1):19-50, 1976.
20. A. C. Yao. Should tables be sorted. J. of the ACM, 28(3):615-628, 1981.