Rates of convergence for Quicksort
From MaRDI portal
Recommendations
Cited in
(13)- A note on the Quicksort asymptotics
- Random binary trees: from the average case analysis to the asymptotics of distributions
- Central limit theorem in uniform metrics for generalized Kac equations
- On the contraction method with degenerate limit equation.
- A general limit theorem for recursive algorithms and combinatorial structures
- Exact \(L^2\)-distance from the limit for QuickSort key comparisons (extended abstract).
- Distribution of distances in random binary search trees.
- Distributional convergence for the number of symbol comparisons used by QuickSort
- Distributional convergence for the number of symbol comparisons used by QuickSort (extended abstract)
- On martingale tail sums for the path length in random trees
- Refined quicksort asymptotics
- Almost sure convergence to the quicksort process
- Quicksort asymptotics
This page was built for publication: Rates of convergence for Quicksort
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4799522)