Bounds for Selection

DOI10.1137/0205010MaRDI QIDQ4088275zbMATH OpenOpenAlexFDO

Authors Laurent Hyafil

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

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Algorithms in computer science (68W99)

Cited in

(13)

• Progress in selection
• On the median-of-k version of Hoare's selection algorithm
• Selecting the k largest elements with parity tests
• Architecture independent parallel selection with applications to parallel priority queues
• On selecting the k largest with median tests
• Selection Algorithms with Small Groups
• Producing posets
• scientific article; zbMATH DE number 7765400 (Why is no real title available?)
• Select with groups of 3 or 4
• A note on upper bounds for the selection problem
• Selecting the top three elements
• A selectable sloppy heap
• Optimal parallel selection in sorted matrices

This page was built for publication: Bounds for Selection

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