A limiting distribution for quicksort
From MaRDI portal
Recommendations
- A limit theorem for “quicksort”
- A note concerning the limit distribution of the quicksort algorithm
- Some properties of a limiting distribution in Quicksort
- Approximating the limiting quicksort distribution
- The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract).
Cites work
- Combinatorial analysis of quicksort algorithm
- Direct martingale arguments for stability: The M/G/1 case
- Exact and asymptotic distributions in digital and binary search trees
- scientific article; zbMATH DE number 3126031 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3538599 (Why is no real title available?)
- Quicksort
- The analysis of Quicksort programs
Cited in
(54)- Automatic average-case analysis of algorithms
- Distances in random plane-oriented recursive trees
- A characterization of the set of fixed points of the quicksort transformation
- Perfect simulation from the quicksort limit distribution
- General Edgeworth expansions with applications to profiles of random trees
- Exact and approximate limit behaviour of the Yule tree's cophenetic index
- On the tails of the limiting QuickSort density
- On weighted depths in random binary search trees
- Some properties of a limiting distribution in Quicksort
- Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
- Distributional convergence for the number of symbol comparisons used by QuickSort
- Cost functionals for large (uniform and simply generated) random trees
- Almost sure convergence to the quicksort process
- QuickSort: improved right-tail asymptotics for the limiting distribution, and large deviations
- The quicksort process
- An intuitive and simple bounding argument for Quicksort
- Search trees: metric aspects and strong limit theorems
- Random binary trees: from the average case analysis to the asymptotics of distributions
- Asymptotic distributions for random median quicksort
- Logarithmic integrals, zeta values, and tiered binomial coefficients
- On the number of iterations required by von Neumann addition
- Approximating the limiting quicksort distribution
- On a multivariate contraction method for random recursive structures with applications to quicksort
- Distributional convergence for the number of symbol comparisons used by QuickSelect
- The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract).
- Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
- The weighted branching process
- scientific article; zbMATH DE number 1375579 (Why is no real title available?)
- Running time of the treapsort algorithm
- Combinatorial analysis of quicksort algorithm
- On the internal path length ofd-dimensional quad trees
- An almost sure result for path lengths in binary search trees
- scientific article; zbMATH DE number 1552325 (Why is no real title available?)
- A note concerning the limit distribution of the quicksort algorithm
- Analysis of quickselect : an algorithm for order statistics
- Asymptotic distribution theory for Hoare's selection algorithm
- scientific article; zbMATH DE number 909705 (Why is no real title available?)
- On the tails of the limiting QuickSort density
- Stochastic fixed-point equations
- A note on the Quicksort asymptotics
- On densities for solutions to stochastic fixed point equations
- Uniform distribution modulo one and binary search trees
- Minimal clade size and external branch length under the neutral coalescent
- On martingale tail sums for the path length in random trees
- A limit theorem for “quicksort”
- Upper tail analysis of bucket sort and random tries
- Upper tail analysis of bucket sort and random tries
- Balancing \(m\)-ary search trees with compressions on the fringe
- General combinatorial schemas: Gaussian limit distributions and exponential tails
- The total path length of split trees
- The Sackin index and depth of leaves in generalized Schröder trees
- Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform
- On the tails of the limiting Quicksort distribution
- On the silhouette of binary search trees
This page was built for publication: A limiting distribution for quicksort
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833634)
