Randomized Search Trees

Algorithmica (New York)

Volumn 16, Issue 4-5, 1996, Pages 464-497

  Seidel, R ^a,b   Aragon, C R ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

Dictionaries; Randomized data structures; Search trees

Indexed keywords

EID: 1542395904     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf01940876     Document Type: Article

References (31)

1. G. M. Adel'son-Velskii and Y. M. Landis, An algorithm for the organization of information, Soviet Math. Dokl., 3 (1962), 1259-1262.
2. A. Andersson and T. Ottmann, Faster uniquely represented dictionaries, Proc. 32nd FOCS, 1991, pp. 642-649.
3. H. Baumgarten, H. Jung, and K. Mehlhorn, Dynamic point location in general subdivision, Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms (SODA), 1992, pp. 250-258.
4. R. Bayer and E. McCreight, Organization and maintenance of large ordered indices, Act. Inf., 1 (1972), 173-189.
5. S. W. Bent and J. R. Driscoll, Randomly balanced search trees, Manuscript (1991).
6. S. W. Bent, D. D. Sleator, and R. E. Tarjan, Biased search trees, SIAM J. Comput., 14 (1985), 545-568.
7. R. P. Brent, Fast multiple precision evaluation of elementary functions, J. Assoc. Comput. Mach., 23 (1976), 242-251.
8. M. Brown, Addendum to "A Storage Scheme for Height-Balanced Trees," Inform. Process. Lett., 8 (1979), 154-156.
9. K.L. Clarkson, K. Mehlhorn, and R. Seidel, Four results on randomized incremental construction, Comput. Geom. Theory Appl., 3 (1993), 185-212.
10. L. Devroye, A note on the height of binary search trees, J. Assoc. Comput. Mach., 33 (1986), 489-498.
11. M. Dietzfelbinger (private communication).
12. I. Galperin and R. L. Rivest, Scapegoat trees, Proc. 4th ACM-SIAM Symp. on Discrete Algorithms (SODA), 1993, pp. 165-174.
13. L. J. Guibas and R. Sedgewick, A dichromatic framework for balanced trees, Proc. 19th FOCS, 1978, pp. 8-21.
14. T. Hagerup and C. Rüb, A guided tour of Chernoff bounds, Inform. Process. Lett., 33 (1989/90), 305-308.
15. K. Hoffman, K. Mehlhorn, P. Rosenstiehl, and R. E. Tarjan, Sorting Jordan sequences in linear time using level linked search trees, Inform. and Control, 68 (1986), 170-184.
16. E. McCreight, Priority search trees, SIAM J. Comput., 14 (1985), 257-276.
17. K. Mehlhorn, Sorting and Searching, Springer-Verlag, Berlin, 1984.
18. K. Mehlhorn, Multi-Dimensional Searching and Computational Geometry, Springer-Verlag, Berlin, 1984.
19. K. Mehlhorn (private communication).
20. K. Mehlhorn and S. Näher, Algorithm design and software libraries: recent developments in the LEDA project, in Algorithms, Software, Architectures, Information Processing 92, Vol. 1, Elsevier, Amsterdam, 1992.
21. K. Mehlhorn and S. Näher, LEDA, a platform for combinatorial and geometric computing. Commun. ACM, 38 (1995), 95-102.
22. K. Mehlhorn and R. Raman (private communication).
23. K. Mulmuley, Computational Geometry: An Introduction through Randomized Algorithms, Prentice-Hall, Englewood Cliffs, NJ, 1994.
24. S. Näher, LEDA User Manual Version 3.0. Tech. Report MPI-I-93-109, Max-Planck-Institut für Informatik, Saarbrücken, 1993.
25. J. Nievergelt and E. M. Reingold, Binary search trees of bounded balance, SIAM J. Comput. 2 (1973), 33-43.
26. W. Pugh, Skip lists: a probabilistic alternative to balanced trees. Commun. ACM, 33 (1990), 668-676.
27. W. Pugh and T. Teitelbaum, Incremental computation via function caching, Proc. 16th ACM POPL, 1989, pp. 315-328.
28. D. D. Sleator (private communication).
29. D. D. Sleator and R. E. Tarjan, Self-adjusting binary search trees, J. Assoc. Comput. Mach., 32 (1985), 652-686.
30. R. E. Tarjan (private communication).
31. J. Vuillemin, A unifying look at data structures, Comm. ACM, 23 (1980), 229-239.