Selecting the top three elements
From MaRDI portal
Publication:1171878
DOI10.1016/0166-218X(82)90048-8zbMath0499.68018MaRDI QIDQ1171878
Publication date: 1982
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Information storage and retrieval of data (68P20) Total orders (06A05) Discrete mathematics in relation to computer science (68R99)
Related Items
Producing posets ⋮ Errata to ``Selecting the top three elements by M. Aigner: A result of a computer-assisted proof search ⋮ On partial sorting in restricted rounds ⋮ The double selection problem ⋮ Closing a Long-Standing Complexity Gap for Selection: V 3(42) = 50 ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems)
Cites Work
This page was built for publication: Selecting the top three elements