New upper bounds for selection
From MaRDI portal
Publication:4099208
DOI10.1145/360336.360339zbMath0333.68033WikidataQ127782646 ScholiaQ127782646MaRDI QIDQ4099208
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
68Q25: Analysis of algorithms and problem complexity
68W30: Symbolic computation and algebraic computation
68N01: General topics in the theory of software
68W99: Algorithms in computer science
Related Items
Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers, Selection Algorithms with Small Groups, Progress in selection, Finding a mediocre player, Unnamed Item, Producing posets, A note on upper bounds for the selection problem, Finding the \(\alpha n\)-th largest element, On partial sorting in restricted rounds, A selectable sloppy heap