Random binary trees: from the average case analysis to the asymptotics of distributions
From MaRDI portal
Publication:2457886
DOI10.1007/s00591-006-0001-zzbMath1129.60009MaRDI QIDQ2457886
Publication date: 23 October 2007
Published in: Mathematische Semesterberichte (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00591-006-0001-z
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Applications of the theory of records in the study of random trees
- A general limit theorem for recursive algorithms and combinatorial structures
- Mixed Poisson approximation of node depth distributions in random binary search trees
- The contraction method for recursive algorithms
- Randomized search trees
- A limiting distribution for quicksort
- A note on the height of binary search trees
- Probability with Martingales
- Hoare's Selection Algorithm: A Markov Chain Approach
- Rates of convergence for Quicksort
- Asymptotic distribution theory for Hoare's selection algorithm
- Randomized binary search technique
- A limit theorem for “quicksort”