A note concerning the limit distribution of the quicksort algorithm
From MaRDI portal
Publication:4717040
Recommendations
- A limiting distribution for quicksort
- Some properties of a limiting distribution in Quicksort
- Approximating the limiting quicksort distribution
- A note on the Quicksort asymptotics
- A limit theorem for “quicksort”
- On the tails of the limiting Quicksort distribution
- QuickSort: improved right-tail asymptotics for the limiting distribution, and large deviations
Cites work
- scientific article; zbMATH DE number 3126031 (Why is no real title available?)
- scientific article; zbMATH DE number 4060392 (Why is no real title available?)
- scientific article; zbMATH DE number 486467 (Why is no real title available?)
- scientific article; zbMATH DE number 3338262 (Why is no real title available?)
- A limit theorem for “quicksort”
- A limiting distribution for quicksort
- Combinatorial analysis of quicksort algorithm
- Quicksort
Cited in
(12)- Using nonlinear difference equations to study Quicksort algorithms
- On the silhouette of binary search trees
- A limit theorem for “quicksort”
- Perfect simulation from the quicksort limit distribution
- Asymptotic distributions for random median quicksort
- Distributional convergence for the number of symbol comparisons used by QuickSort
- QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations (Extended Abstract)
- On the tails of the limiting Quicksort distribution
- A limiting distribution for quicksort
- Asymptotic analysis of an optimized quicksort algorithm.
- Revisiting calculation of moments of number of comparisons used by the randomized quick sort algorithm
- Computing and Combinatorics
This page was built for publication: A note concerning the limit distribution of the quicksort algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4717040)
