Closing a Long-Standing Complexity Gap for Selection: V 3(42) = 50

DOI10.1007/978-3-642-40273-9_6zbMath1394.68185OpenAlexW30731058MaRDI QIDQ2848968

David G. Kirkpatrick

Publication date: 13 September 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40273-9_6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

Select with Groups of 3 or 4 ⋮ On partial sorting in restricted rounds ⋮ A selectable sloppy heap ⋮ Selection Algorithms with Small Groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Selection and sorting with limited storage
• Selecting the top three elements
• Errata to ``Selecting the top three elements by M. Aigner: A result of a computer-assisted proof search
• Average case selection
• A Unified Lower Bound for Selection and Set Partitioning Problems
• Optimal Time Minimal Space Selection Algorithms
• An Efficient Algorithm for Partial Order Production
• Automata, Languages and Programming

This page was built for publication: Closing a Long-Standing Complexity Gap for Selection: V 3(42) = 50