Multiple Quickselect -- Hoare's Find algorithm for several elements
From MaRDI portal
Publication:672250
DOI10.1016/0020-0190(95)00150-BzbMath0875.68313MaRDI QIDQ672250
Publication date: 27 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items (14)
On quickselect, partial sorting and multiple Quickselect ⋮ Near-optimal online multiselection in internal and external memory ⋮ QuickSelect Tree Process Convergence, With an Application to Distributional Convergence for the Number of Symbol Comparisons Used by Worst-Case Find ⋮ Analysis of multiple quickselect variants. ⋮ Analysis of the expected number of bit comparisons required by quickselect ⋮ The analysis of range quickselect and related problems ⋮ Analysis of swaps in radix selection ⋮ Distributional analysis of swaps in quick select ⋮ Streaming Algorithms for Selection and Approximate Sorting ⋮ Limit laws for the Randić index of random binary tree models ⋮ Mixed distributions in Sattolo's algorithm for cyclic permutations via randomization and derandomization ⋮ Distributional Convergence for the Number of Symbol Comparisons Used by Quickselect ⋮ Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm ⋮ Binary search tree recursions with harmonic toll functions
Uses Software
Cites Work
- Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
- Analysis of Hoare's FIND algorithm with Median-of-three partition
- Approximation Theorems of Mathematical Statistics
- Analysis of quickselect : an algorithm for order statistics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Multiple Quickselect -- Hoare's Find algorithm for several elements
