New upper bounds for selection

DOI10.1145/360336.360339zbMATH Open0333.68033OpenAlexW2042224449WikidataQ127782646 ScholiaQ127782646MaRDI QIDQ4099208FDOQ4099208

Authors Chee K. 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

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

(10)

• Progress in selection
• Finding the \(\alpha n\)-th largest element
• Selection Algorithms with Small Groups
• On partial sorting in restricted rounds
• Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers
• Producing posets
• Title not available (Why is no real title available?)
• Finding a mediocre player
• A note on upper bounds for the selection problem
• A selectable sloppy heap

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4099208)