A note on upper bounds for the selection problem

DOI10.1016/0020-0190(82)90120-XMaRDI QIDQ1171384zbMATH OpenFDO

Authors Tatsuya Motoki

Publication date 1982

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

worst-case analysisminimum comparison selectionoptimum sorting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Cites work

• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3342853 (Why is no real title available?)
• A Unified Lower Bound for Selection and Set Partitioning Problems
• Bounds for Selection
• Finding the median
• New upper bounds for selection
• Time bounds for selection

Cited in

(3)

• Progress in selection
• Finding the n-th largest element
• Combinatorial analysis (nonnegative matrices, algorithmic problems)

This page was built for publication: A note on upper bounds for the selection problem

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