Bounds for Selection
From MaRDI portal
Publication:4088275
DOI10.1137/0205010zbMath0324.68028OpenAlexW2044732624MaRDI QIDQ4088275
Publication date: 1976
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0205010
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Permutations, words, matrices (05A05) Algorithms in computer science (68W99)
Related Items (13)
On the median-of-k version of Hoare's selection algorithm ⋮ Select with Groups of 3 or 4 ⋮ Progress in selection ⋮ On selecting the k largest with median tests ⋮ Architecture independent parallel selection with applications to parallel priority queues ⋮ Producing posets ⋮ Unnamed Item ⋮ A note on upper bounds for the selection problem ⋮ Selecting the top three elements ⋮ Selecting the \(k\) largest elements with parity tests ⋮ Optimal parallel selection in sorted matrices ⋮ A selectable sloppy heap ⋮ Selection Algorithms with Small Groups
This page was built for publication: Bounds for Selection
