Producing posets

DOI10.1016/0012-365X(81)90197-7zbMath0456.68065OpenAlexW2914578136MaRDI QIDQ1151047

Martin Aigner

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1016/0012-365x(81)90197-7

zbMATH Keywords

sortingselection

Mathematics Subject Classification ID

Partial orders, general (06A06) Searching and sorting (68P10)

Related Items (6)

Selecting the top three elements ⋮ New results from an algorithm for counting posets ⋮ Sorting with expensive comparands ⋮ The double selection problem ⋮ Finding a mediocre player ⋮ On Generalized Comparison-Based Sorting Problems

Cites Work

• Selecting the top three elements
• Finding the median
• Forest embeddings in regular graphs of large girth
• Combinatorial theory.
• Parallel complexity of sorting problems
• Bounds for Selection
• New upper bounds for selection
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Producing posets