Analysis of quickselect : an algorithm for order statistics
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3841211 (Why is no real title available?)
- scientific article; zbMATH DE number 53861 (Why is no real title available?)
- scientific article; zbMATH DE number 193197 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3551712 (Why is no real title available?)
- scientific article; zbMATH DE number 3620754 (Why is no real title available?)
- scientific article; zbMATH DE number 194543 (Why is no real title available?)
- scientific article; zbMATH DE number 747041 (Why is no real title available?)
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A limit theorem for “quicksort”
- A limiting distribution for quicksort
- Combinatorial analysis of quicksort algorithm
- Exponential bounds for the running time of a selection algorithm
- Inequalities for E k(X, Y) when the marginals are fixed
- Quicksort
- Quicksort with Equal Keys
- The analysis of Quicksort programs
Cited in
(33)- Asymptotic distribution theory for Hoare's selection algorithm
- On a Constant Arising in the Analysis of Bit Comparisons in Quickselect
- A statistical view on exchanges in Quickselect
- Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm
- Measuring post-quickselect disorder
- Randomized selection in \(n+C+o(n)\) comparisons
- Multiple Quickselect -- Hoare's Find algorithm for several elements
- scientific article; zbMATH DE number 1984552 (Why is no real title available?)
- Distributional analysis of swaps in quick select
- Moves and displacements of particular elements in quicksort
- Fast perfect simulation of Vervaat perpetuities
- Probabilistic analysis of multiple quick select
- Limit laws for partial match queries in quadtrees
- Towards a realistic analysis of the QuickSelect algorithm
- Convergence to type I distribution of the extremes of sequences defined by random difference equation
- A general limit theorem for recursive algorithms and combinatorial structures
- Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
- Sketching with Kerdock's crayons: fast sparsifying transforms for arbitrary linear maps
- Analysis of swaps in radix selection
- A probabilistic analysis of the Floyd–Rivest expected time selection algorithm
- Multikey quickselect
- A generalised Dickman distribution and the number of species in a negative binomial process model
- Quickselect tree process convergence, with an application to distributional convergence for the number of symbol comparisons used by worst-case find
- Mixed distributions in Sattolo's algorithm for cyclic permutations via randomization and derandomization
- QUICKSELECT revisited
- Exact simulation of generalised Vervaat perpetuities
- Convergence of the QuickVal residual
- Quickselect and the Dickman Function
- Average-case analysis of moves in Quick Select
- Density functions for \texttt{QuickQuant} and \texttt{QuickVal}
- The analysis of range quickselect and related problems
- Approximating perpetuities
- Distributional convergence for the number of symbol comparisons used by QuickSelect
This page was built for publication: Analysis of quickselect : an algorithm for order statistics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4858843)
