Lower bounds for predecessor searching in the cell probe model

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2003, Pages 73-83

  Sen, Pranab ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; PROBABILITY; THEOREM PROVING; COMBINATORIAL MATHEMATICS; COSTS; DATA STRUCTURES; DIGITAL STORAGE; INFORMATION THEORY; PROBES;

MEMORY CELLS;

DATA STRUCTURES; RANDOM ACCESS STORAGE;

COMMUNICATION COMPLEXITY; COMPLEXITY THEORY; LOWER-BOUND PROOFS; OPTIMAL BOUNDS; PREDECESSOR PROBLEMS; QUERY SCHEMES; RANDOM ACCESS MEMORY; STORAGE SCHEMES;

EID: 0042014456     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. [Ajt88] M. Ajtai, A lower bound for finding predecessors in Yao's cell probe model, Combinatorica, 8(3), 1988, pages 235-247.
2. [And96] A. Andersson, Faster deterministic sorting and searching in linear space, In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, 1996, pages 135-141.
3. [BF02] P. Beame and F. Fich, Optimal bounds for the predecessor problem and related problems, Journal of Computer and System Sciences, 65(1), 2002, pages 38-72.
4. [BKZ77] P. van Emde Boas, R. Kaas and E. Zijlstra, Design and implementation of an efficient priority queue, Mathematical Systems Theory, 10, 1977, pages 99-127.
5. [BMRV00] H. Buhrman, Peter Bro Miltersen, J. Radhakrishnan and S. Venkatesh, Are bitvectors optimal? In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, 2000, pages 449-458.
6. [Boa77] P. van Emde Boas, Preserving order in a forest in less than logarithmic time and linear space, Information Processing Letters, 6, 1977, pages 80-82.
7. [CCGL99] Amit Chakrabarti, B. Chazelle, B. Gum and A. Lvov, A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube, In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pages 305-311.
8. [CT91] T. Cover and J. Thomas, Elements of Information Theory, Wiley Series in Telecommunications, John Wiley and Sons, 1991.
9. [FKS84] M. Fredman, J. Komlós and E. Szemerédi, Storing a sparse table with O(1) worst case access time, Journal of the ACM, 31, 1984, pages 538-544.
10. [FW93] M. Fredman and D. Willard, Surpassing the information theoretic bound with fusion trees, Journal of Computer and System Sciences, 47, 1993, pages 424-436.
11. [Gro96] L. Grover, A fast quantum mechanical algorithm for database search, In proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, pages 212-219.
12. [IM98] P. Indyk, R. Motwani, Approximate nearest neighbors: Towards removing the curse of dimensionality, In proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pages 604-613.
13. [KN97] E. Kushilevitz and N. Nisan, Communication Complexity, Cambridge University Press, 1997.
14. [KNTZ01] H. Klauck, A. Nayak, A. Ta-Shma and D. Zuckerman, Interaction in quantum communication and the complexity of set disjointness, In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001, pages 124-133.
15. [KOR98] E. Kushilevitz, R. Ostrovsky and Y. Rabani, Efficient search for approximate nearest neighbor in high-dimensional spaces, In proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pages 614-623.
16. [Man01] E. Maneva, Interactive communication on noisy channels, Undergraduate senior thesis at California Institute of Technology, USA, 2001. Available at http://www.cs.berkeley.edu/̃elitza/resume.html.
17. [Mil94] Peter Bro Miltersen, Lower bounds for union-split-find related problems on random access machines, In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 1994, pages 625-634.
18. [MNSW98] Peter Bro Miltersen, N. Nisan, S. Safra and A. Wigderson, On data structures and asymmetric communication complexity, Journal of Computer and System Sciences, 57(1), 1998, pages 37-49.
19. [New91] I. Newman, Private vs common random bits in communication complexity, Information Processing Letters, 39, 1991, pages 67-71.
20. [Smi88] D. Smirnov, Shannon's information methods for lower bounds for probabilistic communication complexity, Master's thesis at Moscow University, Russia, 1988.
21. [SV01] P. Sen and S. Venkatesh, Lower bounds in the quantum cell probe model, In Proceedings of the 28th International Colloquium on Automata, Languages and Programming, LNCS 2076, 2001, pages 358-369.
22. [Wil85] D. Willard, Log-logarithmic worst case range queries are possible in space ⊖(n), Information Processing Letters, 17, 1985, pages 81-84.
23. [Xia92] B. Xiao, New bounds in the cell probe model, Ph.D thesis, University of California at San Diego, 1992.
24. [Yao77] A. Yao, Probabilistic computations: Towards a unified measure of complexity, In Proceedings of the 18th Annual Symposium on Foundations of Computer Science, 1977, pages 222-227.
25. [Yao81] A. Yao, Should tables be sorted? Journal of the Association for Computing Machinery, 28(3), 1981, 615-628.