Multiple Quickselect -- Hoare's Find algorithm for several elements
From MaRDI portal
Publication:672250
DOI10.1016/0020-0190(95)00150-BzbMATH Open0875.68313MaRDI QIDQ672250FDOQ672250
Authors: Helmut Prodinger 
Publication date: 27 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Recommendations
- A generating functions approach for the analysis of grand averages for multiple QUICKSELECT
- Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
- On the median-of-k version of Hoare's selection algorithm
- Analysis of multiple quickselect variants.
- Analysis of Hoare's FIND algorithm with Median-of-three partition
Cites Work
- Approximation Theorems of Mathematical Statistics
- Title not available (Why is that?)
- Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
- Title not available (Why is that?)
- Analysis of quickselect : an algorithm for order statistics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Analysis of Hoare's FIND algorithm with Median-of-three partition
Cited In (16)
- Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm
- Title not available (Why is that?)
- Distributional analysis of swaps in quick select
- Binary search tree recursions with harmonic toll functions
- Near-optimal online multiselection in internal and external memory
- Streaming Algorithms for Selection and Approximate Sorting
- Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
- Analysis of the expected number of bit comparisons required by quickselect
- Analysis of swaps in radix selection
- Analysis of multiple quickselect variants.
- Mixed distributions in Sattolo's algorithm for cyclic permutations via randomization and derandomization
- Quickselect tree process convergence, with an application to distributional convergence for the number of symbol comparisons used by worst-case find
- The analysis of range quickselect and related problems
- Limit laws for the Randić index of random binary tree models
- On quickselect, partial sorting and multiple Quickselect
- Distributional convergence for the number of symbol comparisons used by QuickSelect
Uses Software
This page was built for publication: Multiple Quickselect -- Hoare's Find algorithm for several elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672250)
