On the Generation of Random Binary Search Trees
- 1 December 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 24 (6) , 1141-1156
- https://doi.org/10.1137/s0097539792224954
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Binomial random variate generationCommunications of the ACM, 1988
- Branching processes in the analysis of the heights of treesActa Informatica, 1987
- A simple generator for discrete log-concave distributionsComputing, 1987
- A note on the height of binary search treesJournal of the ACM, 1986
- Non-Uniform Random Variate GenerationPublished by Springer Nature ,1986
- Computer generation of hypergeometric random variates†Journal of Statistical Computation and Simulation, 1985
- Sampling from binomial and poisson distributions: A method with bounded computation timesComputing, 1980
- Generating the maximum of independent identically distributed random variablesComputers & Mathematics with Applications, 1980
- On Generating Random Variates from an Empirical DistributionA I I E Transactions, 1974
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963