Selecting the top three elements

DOI10.1016/0166-218X(82)90048-8MaRDI QIDQ1171878zbMATH OpenFDO

Authors Martin Aigner

Publication date 1982

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(82)90048-8

zbMATH Keywords

binary treelinear orderoptimal comparison treepathselection problem

Mathematics Subject Classification ID

Trees (05C05) Total orders (06A05) Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Cites work

• Bounds for Selection
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3322504 (Why is no real title available?)
• scientific article; zbMATH DE number 3342853 (Why is no real title available?)
• Producing posets

Cited in

(6)

• Combinatorial analysis (nonnegative matrices, algorithmic problems)
• Producing posets
• Errata to ``Selecting the top three elements by M. Aigner: A result of a computer-assisted proof search
• The double selection problem
• On partial sorting in restricted rounds
• Closing a long-standing complexity gap for selection: \(V _{3}(42) = 50\)

This page was built for publication: Selecting the top three elements

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