A note concerning the limit distribution of the quicksort algorithm
From MaRDI portal
Publication:4717040
DOI10.1051/ITA/1996300301951zbMATH Open0860.68052OpenAlexW183138928MaRDI QIDQ4717040FDOQ4717040
Authors: Michael Cramer
Publication date: 29 April 1997
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92534
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
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
- QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations (Extended Abstract)
- Distributional convergence for the number of symbol comparisons used by QuickSort
- 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
Uses Software
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)