Distributional analysis of swaps in quick select
From MaRDI portal
Publication:964394
DOI10.1016/j.tcs.2010.01.029zbMath1192.68201OpenAlexW1978359937MaRDI QIDQ964394
Publication date: 15 April 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.01.029
algorithmsortingrecurrencequick sortaverage-case analysisgrand averagecombinatorial probabilityperpetuity
Related Items (3)
Analysis of swaps in radix selection ⋮ Perpetuities in Fair Leader Election Algorithms ⋮ Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximating perpetuities
- Multiple Quickselect -- Hoare's Find algorithm for several elements
- Moves and displacements of particular elements in quicksort
- A general limit theorem for recursive algorithms and combinatorial structures
- Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
- Quickselect and the Dickman Function
- Comparisons in Hoare's Find Algorithm
- Hoare's Selection Algorithm: A Markov Chain Approach
- A generating functions approach for the analysis of grand averages for multiple QUICKSELECT
- Analysis of quickselect : an algorithm for order statistics
- Asymptotic distribution theory for Hoare's selection algorithm
- Average-case analysis of moves in Quick Select
- A limit theorem for “quicksort”
- Quicksort
This page was built for publication: Distributional analysis of swaps in quick select
