New upper bounds for selection

DOI10.1145/360336.360339zbMath0333.68033OpenAlexW2042224449WikidataQ127782646 ScholiaQ127782646MaRDI QIDQ4099208

Chee-Keng Yap

Publication date: 1976

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/360336.360339

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items (10)

Progress in selection ⋮ Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers ⋮ Finding the \(\alpha n\)-th largest element ⋮ Producing posets ⋮ Unnamed Item ⋮ A note on upper bounds for the selection problem ⋮ On partial sorting in restricted rounds ⋮ Finding a mediocre player ⋮ A selectable sloppy heap ⋮ Selection Algorithms with Small Groups

This page was built for publication: New upper bounds for selection