A note on the Quicksort asymptotics
From MaRDI portal
Publication:5265342
Recommendations
Cites work
- A limiting distribution for quicksort
- An asymptotic theory for Cauchy–Euler differential equations with applications to the analysis of algorithms
- Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
- Quicksort asymptotics
- Rates of convergence for Quicksort
- Transfer theorems and asymptotic distributional results for m‐ary search trees
Cited in
(18)- Asymptotic analysis of an optimized quicksort algorithm.
- Distributional convergence for the number of symbol comparisons used by QuickSort
- Asymptotic distributions for random median quicksort
- Logarithmic integrals, zeta values, and tiered binomial coefficients
- Exact L^2-distance from the limit for QuickSort key comparisons (extended abstract).
- Revisiting calculation of moments of number of comparisons used by the randomized quick sort algorithm
- scientific article; zbMATH DE number 5568413 (Why is no real title available?)
- On martingale tail sums in affine two-color urn models with multiple drawings
- A note concerning the limit distribution of the quicksort algorithm
- Quicksort asymptotics
- Rates of convergence for Quicksort
- Refined quicksort asymptotics
- Refined asymptotics for the number of leaves of random point quadtrees
- Computing and Combinatorics
- Dependence and phase changes in random m-ary search trees
- On martingale tail sums for the path length in random trees
- A limit theorem for “quicksort”
- Convergence of the QuickVal residual
This page was built for publication: A note on the Quicksort asymptotics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265342)