Progress in selection

DOI10.1007/3-540-61422-2_146zbMath1502.68111OpenAlexW1526735133MaRDI QIDQ5054828

Mike S. Paterson

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT'96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61422-2_146

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (7)

Select with Groups of 3 or 4 ⋮ Fast algorithms for finding disjoint subsequences with extremal densities ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Finding a mediocre player ⋮ A selectable sloppy heap ⋮ Selection Algorithms with Small Groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On log concavity for order-preserving maps of partial orders
• A note on upper bounds for the selection problem
• Finding the median
• Time bounds for selection
• Inequalities for the number of monotonic functions of partial orders
• Finding the \(\alpha n\)-th largest element
• Median Selection Requires $(2+\epsilon)n$ Comparisons
• New algorithms for selection
• A Unified Lower Bound for Selection and Set Partitioning Problems
• Bounds for Selection
• New upper bounds for selection
• A Counting Approach to Lower Bounds for Selection Problems

This page was built for publication: Progress in selection