Progress in selection
From MaRDI portal
Publication:5054828
DOI10.1007/3-540-61422-2_146zbMath1502.68111MaRDI QIDQ5054828
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
68P10: Searching and sorting
Related Items
Unnamed Item, Selection Algorithms with Small Groups, Finding a mediocre player, Unnamed Item, Fast algorithms for finding disjoint subsequences with extremal densities, A selectable sloppy heap, Select with Groups of 3 or 4
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