Lower bounds for predecessor searching in the cell probe model

Journal of Computer and System Sciences

Volumn 74, Issue 3, 2008, Pages 364-385

  Sen, Pranab ^a   Venkatesh, S ^b  

^a NEC LABORATORIES AMERICA   (United States)

^b UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Cell probe model; Data structures; Lower bounds; Predecessor searching problem

Indexed keywords

BRANCH AND BOUND METHOD; COMPUTATIONAL EFFICIENCY; PROBLEM SOLVING; QUERY LANGUAGES; STATIC ANALYSIS; TABU SEARCH;

CELL PROBE MODELS; FICH'S PROOF; LOWER BOUNDS; PREDECESSOR SEARCHING PROBLEM;

DATA STRUCTURES;

EID: 38149004824     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2007.06.016     Document Type: Article

References (44)

1. D. Aharonov, A. Kitaev, N. Nisan, Quantum circuits with mixed states, in: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 20-30
2. Ajtai M. A lower bound for finding predecessors in Yao's cell probe model. Combinatorica 8 3 (1988) 235-247
3. A. Andersson, Faster deterministic sorting and searching in linear space, in: Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, 1996, pp. 135-141
4. Beame P., and Fich F. Optimal bounds for the predecessor problem and related problems. J. Comput. System Sci. 65 1 (2002) 38-72
5. Buhrman H., Miltersen P.B., Radhakrishnan J., and Venkatesh S. Are bitvectors optimal?. SIAM J. Comput. 31 6 (2002) 1723-1744
6. A. Chakrabarti, O. Regev, An optimal randomised cell probe lower bound for approximate nearest neighbour searching, in: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2004, pp. 473-482
7. Cleve R., van Dam Wim., Nielsen M., and Tapp A. Quantum entanglement and the communication complexity of the inner product function. Proceedings of the 1st NASA International Conference on Quantum Computing and Quantum Communications. Lecture Notes in Comput. Sci. vol. 1509 (1998), Springer-Verlag 61-74
8. Cover T., and Thomas J. Elements of Information Theory. Wiley Series in Telecommunications (1991), John Wiley and Sons
9. Dacunha-Castelle D., Heyer H., and Roynette B. Ecole d'Eté de Probabilités de Saint-Flour VII. Lecture Notes in Math. vol. 678 (1978), Springer-Verlag
10. Farhi E., Goldstone J., Gutmann S., and Sipser M. Invariant quantum algorithms for insertion into an ordered list. manuscript at (January 1999). http://arxiv.org/abs/quant-ph/9901059
11. Fredman M., Komlós J., and Szemerédi E. Storing a sparse table with O (1) worst case access time. J. Assoc. Comput. Mach. 31 3 (1984) 538-544
12. Fredman M., and Willard D. Surpassing the information theoretic bound with fusion trees. J. Comput. System Sci. 47 (1993) 424-436
13. Fuchs C., and Caves C. Mathematical techniques for quantum communication theory. Open Syst. Inf. Dyn. 3 3 (1995) 345-356. http://arxiv.org/abs/quant-ph/9604001 preliminary version at
14. L. Grover, A fast quantum mechanical algorithm for database search, in: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 212-219
15. Høyer P., Neerbek J., and Shi Y. Quantum complexities of ordered searching, sorting, and element distinctness. Algorithmica 34 4 (2002) 429-448
16. 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, pp. 604-613
17. Jain R., Radhakrishnan J., and Sen P. A direct sum theorem in communication complexity via message compression. Proceedings of the 30th International Colloquium on Automata, Languages and Programming. Lecture Notes in Comput. Sci. vol. 2719 (2003), Springer-Verlag 300-315
18. R. Jain, J. Radhakrishnan, P. Sen, Prior entanglement, message compression and privacy in quantum communication, in: Proceedings of the 20th Annual IEEE Conference on Computational Complexity, 2005, pp. 285-296
19. Jozsa R. Fidelity for mixed quantum states. J. Modern Opt. 41 12 (1994) 2315-2323
20. Kerenidis I., and de Wolf R. Exponential lower bound for 2-query locally decodable codes via a quantum argument. J. Comput. System Sci. 69 3 (2004) 395-420
21. Klauck H. Quantum communication complexity. Proceedings of the Satellite Workshops at the 27th International Colloquium on Automata, Languages and Programming, Workshop on Boolean Functions and Applications (invited lecture) (2000), Carleton Scientific, Waterloo, Ontario, Canada 241-252. http://arxiv.org/abs/quant-ph/0005032 also available at
22. H. Klauck, A. Nayak, Amnon Ta-Shma, 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, pp. 124-133
23. I. Kremer, Quantum communication, Master's thesis, Hebrew University, 1995
24. Kushilevitz E., and Nisan N. Communication Complexity (1997), Cambridge University Press
25. Kushilevitz E., Ostrovsky R., and Rabani Y. Efficient search for approximate nearest neighbor in high-dimensional spaces. SIAM J. Comput. 30 2 (2000) 457-474
26. Liu D. A strong lower bound for approximate nearest neighbor searching. Inform. Process. Lett. 92 1 (2004) 23-29
27. Maneva E. Interactive communication on noisy channels. Bachelor's thesis, California Institute of Technology, 2001; available at. http://www.cs.berkeley.edu/~elitza/resume.html
28. P.B. 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, pp. 625-634
29. Bro Miltersen P., Nisan N., Safra S., and Wigderson A. On data structures and asymmetric communication complexity. J. Comput. System Sci. 57 1 (1998) 37-49
30. Newman I. Private vs. common random bits in communication complexity. Inform. Process. Lett. 39 (1991) 67-71
31. Nielsen M., and Chuang I. Quantum Computation and Quantum Information (2000), Cambridge University Press
32. Nisan N. The communication complexity of threshold gates. Combinatorics, Paul Erdo{combining double acute accent}s is Eighty, vol. 1 (1993), János Bolyai Mathematical Society, Budapest, Hungary 301-315
33. M. Pǎtraşcu, M. Thorup, Lower bounds for randomized predecessor search, unpublished manuscript, 2006
34. M. Pǎtraşcu, M. Thorup, Time-space trade-offs for predecessor search, in: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006, pp. 232-240
35. P. Sen, Lower bounds for predecessor searching in the cell probe model, in: Proceedings of the 18th Annual IEEE Conference on Computational Complexity, 2003, pp. 73-83
36. Sen P., and Venkatesh S. Lower bounds in the quantum cell probe model. Proceedings of the 28th International Colloquium on Automata, Languages and Programming. Lecture Notes in Comput. Sci. vol. 2076 (2001), Springer-Verlag 358-369
37. D. Smirnov, Shannon's information methods for lower bounds for probabilistic communication complexity, Master's thesis, Moscow University, 1988
38. van Emde Boas P. Preserving order in a forest in less than logarithmic time and linear space. Inform. Process. Lett. 6 (1977) 80-82
39. van Emde Boas P., Kaas R., and Zijlstra E. Design and implementation of an efficient priority queue. Math. Systems Theory 10 (1977) 99-127
40. Willard D. Log-logarithmic worst case range queries are possible in space θ (n). Inform. Process. Lett. 17 (1985) 81-84
41. B. Xiao, New bounds in cell probe model, PhD thesis, University of California at San Diego, 1992
42. A. Yao, Quantum circuit complexity, in: Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, 1993, pp. 352-361
43. A.C.-C. Yao, Probabilistic computations: Towards a unified measure of complexity, in: Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science, 1977, pp. 222-227
44. Yao A.C.-C. Should tables be sorted?. J. Assoc. Comput. Mach. 28 3 (1981) 615-628