Optimal bounds for the predecessor problem and related problems

Journal of Computer and System Sciences

Volumn 65, Issue 1, 2002, Pages 38-72

  Beame, Paul ^a   Fich, Faith E ^b  

^a UNIVERSITY OF WASHINGTON   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; MATHEMATICAL MODELS; QUERY LANGUAGES; RANDOM ACCESS STORAGE; SET THEORY;

LOWER BOUNDS; OPTIMAL BOUNDS; PREDECESSOR PROBLEMS; UPPER BOUNDS;

PROBLEM SOLVING;

EID: 23844490875     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1006/jcss.2002.1822     Document Type: Conference Paper

References (50)

1. M. Ajtai, M. Fredman, and J. Komlós, Hash functions for priority queues, Inform. and Control 63 (1984), 217-225.
2. Miklós Ajtai, A lower bound for finding predecessors in Yao's cell probe model, Combinatorica 8 (1988), 235-247.
3. S. Alstrup, G. Brodal, and T. Rauhe, Optimal static range reporting in one dimension, in "Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, Hersonissos, Crete, Greece, July 2001," pp. 476-482.
4. S. Alstrup, T. Husfeldt, and T. Rauhe, Marked ancestor problems, in "Proceedings 39th Annual Symposium on Foundations of Computer Science, Palo Alto, CA, November 1998," pp. 534-543, IEEE Comput. Soc. Press, Los Alamitos, CA.
5. A. Amir, A. Efrat, P. Indyk, and H. Samet, Efficient regular data structures and algorithms for location and proximity problems, in "Proceedings 40th Annual Symposium on Foundations of Computer Science, New York, NY, October 1999," pp. 160-170.
6. A. Andersson, Sublogarithmic seaching without multiplications, in "Proceedings 36th Annual Symposium on Foundations of Computer Science, Milwaukee, WI, October 1995," pp. 655-665, IEEE Comput. Soc. Press, Los Alamitos, CA.
7. A. Andersson, Faster deterministic sorting and seaching in linear space, in "Proceedings 37th Annual Symposium on Foundations of Computer Science, Burlington, VT, October 1996," pp. 135-141, IEEE Comput. Soc. Press, Los Alamitos, CA.
8. 0 RAMs: query time ⊖(√/logn/log log n) is necessary and sufficient, in "Proceedings 37th Annual Symposium on Foundations of Computer Science, Burlington, VT, October 1996," pp. 441-450, IEEE Comput. Soc. Press, Los Alamitos, CA.
9. 0 instructions only, Theoret. Comput. Sci. 215 (1999), 337-344.
10. A. Andersson and M. Thorup, Tight(er) worst-case bounds on dynamic searching and priority queues, in "Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, Portland, OR, May 2000," pp. 335-342.
11. G. Brodal, Predecessor queries in dynamic integer sets, in "(STAGS) 97: 14th Annual Symposium on Theoretical Aspects of Computer Science," Lecture Notes in Computer Science, Vol. 1200, pp. 21-32, Springer-Verlag, Berlin/New York, February 1997.
12. A. Brodnik, P. B. Miltersen, and I. Munro, Trans-dichotomous algorithms without multiplications - some upper and lower bounds, in "Proceedings of the 5th Workshop on Algorithms and Data Structures, Halifax, NS, Canada, 1997," Lecture Notes in Computer Science, Vol. 1272, pp. 426-439, Springer-Verlag, Berlin/New York.
13. J. L. Carter and M. N. Wegman, Universal classes of hash functions, J. Comput. System Sci. 18 (1979), 143-154.
14. M. Cary, Towards optimal ε-approximate nearest neighbor algorithms, J. Algorithms 41 (2001), 417-428.
15. A. Chakrabarti, B. Chazelle, B. Gum, and A. Lvov, A good neighbor is hard to find, in "Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, Atlanta, GA, May 1999," pp. 305-311.
16. B. Chazelle, Geometric searching over the rationals, in "Proceedings of the 7th European Symposium on Algorithms," Lecture Notes in Computer Science, pp. 354-365, Springer-Verlag, Berlin/ New York, 1999.
17. B. Chazelle, "The Discrepancy Method: Randomness and Complexity," Cambridge Univ. Press, Cambridge, UK, 2000.
18. V. Chvátal, Probabilistic methods in graph theory, Ann. Oper. Res. 1 (1984), 171-182.
19. M. Dietzfelbinger, J. Gil, Y. Matias, and N. Pippenger, Polynomial hash functions are reliable, in "Automata, Languages, and Programming: 19th International Colloquium," Lecture Notes in Computer Science, Vol. 623, pp. 235-246, Springer-Verlag, Berlin/New York, July 1992.
20. M. Dietzfelbinger, T. Hagerup, J. Katajainen, and M. Penttonen, A reliable randomized algorithm for the closest-pair problem, J. Algorithms 25 (1997), 19-51.
21. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. Tarjan, Dynamic pertect hashing: Upper and lower bounds, SIAM J. Comput. 23 (1994), 738-761.
22. M. Dietzfelbinger and F. Meyer auf der Heide, A new universal class of hash functions and dynamic hashing in real time, in "Automata, Languages, and Programming: 17th International Colloquium, Warwick University, England, July 1990" (M. S. Paterson, Ed.), Lecture Notes in Computer Science, Vol. 443, pp. 6-17, Springer-Verlag, Berlin/New York.
23. [Informatik-Festschrift, zum 60, Geburtstag von Gunter Hotz (J. Buchmann, H. Ganzinger, and W. J. Paul, Eds.), B. G. Teubner, 1992, pp. 95-119]
24. F. Fich and P. B. Miltersen, Tables should be sorted (on random access machines), in "Proceedings of the 4th Workshop on Algorithms and Data Structures," Lecture Notes in Computer Science, Vol. 995, pp. 163-174, Springer-Verlag, Berlin/New York, 1995.
25. G. S. Frandsen, P. B. Miltersen, and S. Skyum, Dynamic word problems, in "Proceedings 34th Annual Symposium on Foundations of Computer Science, Palo Alto, CA, November 1993," pp. 470-479, IEEE Comput. Soc. Press, Los Alamitos, CA.
26. [J. Assoc. Comput. Mach. 44 (1997), 257-71]
27. M. Fredman, J. Komlós, and E. Szemerédi, Storing a sparse table with O(1) worst case access time, J. Assoc. Comput. Mach. 31 (1984), 538-544.
28. M. Fredman and M. Saks, The cell probe complexity of dynamic data structures, in "Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, Seattle, WA, May 1989," pp. 345-354.
29. M. Fredman and D. Willard, Surpassing the information theoretic bound with fusion trees, J. Comput. System Sci. 47 (1993), 424-436.
30. T. Hagerup, Sorting and searching on a word RAM, in "(STACS) 98: 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 1998," Lecture Notes in Computer Science, Vol. 1373, pp. 366-398, Springer-Verlag, Berlin/New York.
31. J. L. Hennessey and D. A. Patterson, "Computer Organization and Design: The Hardware/ Software Interface," Morgan Kaufman, San Mateo, CA, 1994.
32. M. Karchmer and A. Wigderson, Monotone circuits for connectivity require super-logarithmic depth, in "Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, Chicago, IL, May 1988," pp. 539-550.
33. J. A. La Poutré, Lower bounds for the Union-Find and the Split-Find problem on pointer machines, in "Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, Baltimore, MD, May 1990," pp. 34-44.
34. K. Mehlhorn and S. Näher, Dynamic fractional cascading, Algorithmica 5 (1990).
35. K. Mehlhorn, S. Näher, and H. Alt, A lower bound on the complexity of the Union-Split-Find problem, SIAM J. Comput. 17 (1988), 1093-1102.
36. P. B. Miltersen, The bit probe complexity measure revisited, in "STAGS 93 : 10th Annual Symposium on Theoretical Aspects of Computer Science, Wurzburg, Germany, February 1993" (A. Finkel, P. Enjalbert, and K. W. Wagner, Eds.), Lecture Notes in Computer Science, Vol. 665, pp. 662-671, Springer-Verlag, Berlin/New York.
37. P. B. Miltersen, Lower bounds for Union-Split-Find related problems on random access machines, in "Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, Montréal, Québec, Canada, May 1994," pp. 625-634.
38. P. B. Miltersen, Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries, in "Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms," pp. 556-563, 1998.
39. P. B. Miltersen, N. Nisan, S. Safra, and A. Wigderson, On data structures and asymmetric communication complexity, J. Comput. System Sci. 57 (1998), 37-49.
40. Rasmus Pagh, Faster deterministic dictionaries, in "Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms," pp. 487-493, 2000.
41. Y. Perl and E. M. Reingold, Understanding the complexity of interpolation search, Inform. Proces. Lett. 6 (1977), 219-222.
42. R. Raman, Priority queues: Small, monotone, and trans-dichotomous, in "Proceedings of the 4th European Symposium on Algorithms," Lecture Notes in Computer Science, Vol. 1136, pp. 121-137, Springer-Verlag, Berlin/New York, 1996.
43. M. Thorup, Faster deterministic sorting and priority queues in linear space, in "Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms," pp. 550-555, 1998.
44. P. Van Emde Boas, Preserving order in a forest in less than logarithmic time and linear space, Inform. Proces. Lett. 6 (1977), 80-82.
45. P. Van Emde Boas, R. Kaas, and E. Zijlstra, Design and implementation of an efficient priority queue, Math. Systems Theory 10 (1977), 99-127.
46. D. E. Willard, Log-logarithmic worst case range queries are possible in space ⊖(n), Inform. Proces. Lett. 17(1983), 81-84.
47. D. E. Willard, Searching unindexed and nonuniformly generated files in log log N time, SIAM J. Comput. 14 (1985), 1013-1029.
48. Bing Xiao, "New Bounds in Cell Probe Model," Ph.D. thesis, University of California, San Diego, 1992.
49. A. C. Yao, Some complexity questions related to distributive computing, m "Conference Record of the Eleventh Annual ACM Symposium on Theory of Computing, Atlanta, GA, April-May 1979," pp. 209-213.
50. A. C. Yao, Should tables be sorted? J. Assoc. Comput. Mach. 28 (1981), 615-628.