Limit laws for local counters in random binary search trees
- 1 September 1991
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 2 (3) , 303-315
- https://doi.org/10.1002/rsa.3240020305
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Applications of the theory of records in the study of random treesActa Informatica, 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
- Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data StructuresSIAM Journal on Algebraic Discrete Methods, 1985
- Central limit theorems under weak dependenceJournal of Multivariate Analysis, 1981
- Two central limit problems for dependent random variablesProbability Theory and Related Fields, 1978
- A Note on the Central Limit Theorems for Dependent Random VariablesTheory of Probability and Its Applications, 1975
- Branching ProcessesPublished by Springer Nature ,1972
- Martingale Central Limit TheoremsThe Annals of Mathematical Statistics, 1971
- More Combinatorial Properties of Certain TreesThe Computer Journal, 1965