Approximating the limiting Quicksort distribution
From MaRDI portal
Publication:2772925
DOI10.1002/rsa.10007zbMath0990.68053arXivmath/0105246OpenAlexW2046684090MaRDI QIDQ2772925
Svante Janson, James Allen Fill
Publication date: 19 February 2002
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0105246
Related Items (11)
On Tail Bounds for Random Recursive Trees ⋮ Implicit Renewal Theory and Power Tails on Trees ⋮ Stochastic recursions on directed random graphs ⋮ Tail behavior of solutions of linear recursions on trees ⋮ Implicit renewal theorem for trees with general weights ⋮ Exact and approximate limit behaviour of the Yule tree's cophenetic index ⋮ Maximums on trees ⋮ Convergence Rates in the Implicit Renewal Theorem on Trees ⋮ The total path length of split trees ⋮ Information ranking and power laws on trees ⋮ Convergence of the population dynamics algorithm in the Wasserstein metric
Cites Work
- Unnamed Item
- A characterization of the set of fixed points of the quicksort transformation
- Some properties of a limiting distribution in Quicksort
- A limiting distribution for quicksort
- Inequalities for E k(X, Y) when the marginals are fixed
- How Many Comparisons Does Quicksort Use?
- A limit theorem for “quicksort”
This page was built for publication: Approximating the limiting Quicksort distribution
