The left-right-imbalance of binary search trees
From MaRDI portal
Publication:868958
DOI10.1016/j.tcs.2006.10.033zbMath1118.68052OpenAlexW2081805893MaRDI QIDQ868958
Publication date: 26 February 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.10.033
Related Items
An Analysis of the Height of Tries with Random Weights on the Edges ⋮ General Edgeworth expansions with applications to profiles of random trees ⋮ Branching random walks on binary search trees: convergence of the occupation measure ⋮ Imbalance in random digital trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Left and right pathlengths in random binary trees
- Applications of the theory of records in the study of random trees
- On convergence rates in the central limit theorems for combinatorial structures
- A general limit theorem for recursive algorithms and combinatorial structures
- Singularity analysis, Hadamard products, and tree recurrences
- Mixed Poisson approximation of node depth distributions in random binary search trees
- On the analysis of stochastic divide and conquer algorithms
- Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
- Limit laws for embedded trees: Applications to the integrated superBrownian excursion
- Singularity Analysis of Generating Functions
- Exact and asymptotic distributions in digital and binary search trees
- The rotation correspondence is asymptotically a dilatation
- Distances and Finger Search in Random Binary Search Trees
- Poisson approximations for functionals of random trees
- Binary Trees, Left and Right Paths, WKB Expansions, and Painlevé Transcendents
- A limit theorem for “quicksort”
- A Note on the Theory of Moment Generating Functions
