On the expected height of fringe-balanced trees
- 1 May 1993
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 30 (5) , 459-466
- https://doi.org/10.1007/bf01210596
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On the height of randomm‐ary search treesRandom Structures & Algorithms, 1990
- Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov ChainsProbability in the Engineering and Informational Sciences, 1988
- Branching processes in the analysis of the heights of treesActa Informatica, 1987
- A note on the height of binary search treesJournal of the ACM, 1986
- The analysis of a fringe heuristic for binary search treesJournal of Algorithms, 1985
- On growing random binary treesJournal of Mathematical Analysis and Applications, 1984
- Chernoff's theorem in the branching random walkJournal of Applied Probability, 1977
- The first- and last-birth problems for a multitype age-dependent branching processAdvances in Applied Probability, 1976
- Postulates for Subadditive ProcessesThe Annals of Probability, 1974
- Subadditive Ergodic TheoryThe Annals of Probability, 1973