On growing random binary trees
- 1 October 1984
- journal article
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 103 (2) , 461-480
- https://doi.org/10.1016/0022-247x(84)90141-0
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- On the Most Probable Shape of a Search Tree Grown from a Random PermutationSIAM Journal on Algebraic Discrete Methods, 1984
- Limiting Behavior of a Process of RunsThe Annals of Probability, 1981
- On the Average Shape of Binary TreesSIAM Journal on Algebraic Discrete Methods, 1980
- Postulates for Subadditive ProcessesThe Annals of Probability, 1974
- Subadditive Ergodic TheoryThe Annals of Probability, 1973
- A Minimax Analogue of the Weak Law of Large NumbersTheory of Probability and Its Applications, 1971
- On the height of treesJournal of the Australian Mathematical Society, 1967
- More Combinatorial Properties of Certain TreesThe Computer Journal, 1965
- Percolation Processes and Related TopicsJournal of the Society for Industrial and Applied Mathematics, 1963
- Asymptotic Development of the Stirling Numbers of the First KindJournal of the London Mathematical Society, 1958