Phase changes in random m‐ary search trees and generalized quicksort
- 1 October 2001
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 19 (3-4) , 316-358
- https://doi.org/10.1002/rsa.10005
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Normal convergence problem? Two moments and a recurrence may be the cluesThe Annals of Applied Probability, 1999
- On Convergence Rates in the Central Limit Theorems for Combinatorial StructuresEuropean Journal of Combinatorics, 1998
- Large deviations of combinatorial distributions. II. Local limit theoremsThe Annals of Applied Probability, 1998
- On rotations in fringe-balanced binary treesInformation Processing Letters, 1998
- Binary search trees constructed from nondistinct keys with/without specified probabilitiesTheoretical Computer Science, 1996
- Variance of storage requirements for B+-treesActa Informatica, 1995
- Probabilistic analysis of bucket recursive treesTheoretical Computer Science, 1995
- Analysis of the space of search trees under the random insertion algorithmJournal of Algorithms, 1989
- Some average measures in m-ary search treesInformation Processing Letters, 1987
- Periodic oscillations of coefficients of power series that satisfy functional equationsAdvances in Mathematics, 1982