Distances and finger search in random binary search trees

SIAM Journal on Computing

Volumn 33, Issue 3, 2004, Pages 647-658

  Devroye, Luc ^a   Neininger, Ralph ^b  

^a MCGILL UNIVERSITY   (Canada)

^b GOETHE UNIVERSITY   (Germany)

Author keywords

Analysis of algorithms; Limit law; Path distance; Random binary search tree; Ringer search

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; BOUNDARY VALUE PROBLEMS; FUNCTIONS; INTEGRAL EQUATIONS; MATHEMATICAL MODELS; NORMAL DISTRIBUTION; PROBLEM SOLVING; RANDOM PROCESSES; THEOREM PROVING;

ANALYSIS OF ALGORITHMS; FINGER SEARCH; LIMIT LAW; PATH DISTANCE; RANDOM BINARY SEARCH TREES;

TREES (MATHEMATICS);

EID: 3142657514     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703424521     Document Type: Article

References (14)

1. G. S. BRODAL, Finger search trees with constant insertion time, in Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 1998), ACM, New York, 1998, pp. 540-549.
2. M. R. BROWN AND R. E. TARJAN, Design and analysis of a data structure for representing sorted lists, SIAM J. Comput., 9 (1980), pp. 594-614.
3. Y. S. CHOW AND H. TEICHER, Probability Theory. Independence, Interchangeability, Martin-gales, Springer-Verlag, New York, Heidelberg, 1978.
4. L. DEVROYE, Applications of the theory of records in the study of random trees, Acta Inform., 26 (1988), pp. 123-130.
5. P. FLAJOLET, T. OTTMANN, AND D. WOOD, Search trees and bubble memories, RAIRO Inform. Theor., 19 (1985), pp. 137-164.
6. S. HUDDLESTON AND K. MEHLHORN, A new data structure for representing sorted lists, Acta Inform., 17 (1982), pp. 157-184.
7. G. LOUCHARD, Exact and asymptotic distributions in digital and binary search trees, RAIRO Inform. Théor. Appl., 21 (1987), pp. 479-495.
8. H. M. MAHMOUD, Evolution of Random Search Trees, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, Inc., New York, 1992.
9. H. M. MAHMOUD AND R. NEININGER, Distribution of distances in random binary search trees, Ann. Appl. Probab., 13 (2003), pp. 253-276.
10. H. M. MAHMOUD AND B. PITTEL, On the most probable shape of a search tree grown from a random permutation, SIAM J. Algebraic Discrete Methods, 5 (1984), pp. 69-81.
11. M. OKAMOTO, Some inequalities relating to the partial sum of binomial probabilities, Ann. Inst. Statist. Math., 10 (1958), pp. 29-35.
12. A. PANHOLZER AND H. PRODINGER, Spanning tree size in random binary search trees, Ann. Appl. Probab., to appear.
13. H. PRODINGER, Multiple quickselect - Hoare's find algorithm for several elements, Inform. Process. Lett., 56 (1995), pp. 123-129.
14. R. SEIDEL AND C. R. ARAGON, Randomized search trees, Algorithmica, 16 (1996), pp. 464-497.