The double selection problem

DOI10.1016/0012-365X(88)90128-8zbMath0685.68038MaRDI QIDQ1262124

Martin Aigner

Publication date: 1989

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

zbMATH Keywords

selection problempartial ordercomparison algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

On partial sorting in restricted rounds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Producing posets
• Selecting the top three elements
• Finding the median
• A Counting Approach to Lower Bounds for Selection Problems
• A sorting problem and its complexity

This page was built for publication: The double selection problem