Note on the heights of random recursive trees and random m‐ary search trees
- 1 April 1994
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 5 (2) , 337-347
- https://doi.org/10.1002/rsa.3240050207
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- On the structure of random plane‐oriented recursive trees and their branchesRandom Structures & Algorithms, 1993
- On the Distribution of Leaves in Rooted Subtrees of Recursive TreesThe Annals of Applied Probability, 1991
- On the height of randomm‐ary search treesRandom Structures & Algorithms, 1990
- A note on the height of binary search treesJournal of the ACM, 1986
- On the number of terminal vertices in certain random trees with an application to stemma construction in philologyJournal of Applied Probability, 1982
- Chernoff's theorem in the branching random walkJournal of Applied Probability, 1977
- A Probability Model of a Pyramid SchemeThe American Statistician, 1977
- Linear expected time of a simple union-find algorithmInformation Processing Letters, 1976
- 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