Progress in selection
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 910857 (Why is no real title available?)
- scientific article; zbMATH DE number 3322504 (Why is no real title available?)
- scientific article; zbMATH DE number 3342853 (Why is no real title available?)
- A Counting Approach to Lower Bounds for Selection Problems
- A Unified Lower Bound for Selection and Set Partitioning Problems
- A note on upper bounds for the selection problem
- Bounds for Selection
- Finding the n-th largest element
- Finding the median
- Inequalities for the number of monotonic functions of partial orders
- Median selection requires (2+)n comparisons
- New algorithms for selection
- New upper bounds for selection
- On log concavity for order-preserving maps of partial orders
- Time bounds for selection
Cited in
(11)- scientific article; zbMATH DE number 3212714 (Why is no real title available?)
- Fast algorithms for finding disjoint subsequences with extremal densities
- scientific article; zbMATH DE number 2014744 (Why is no real title available?)
- Selection Algorithms with Small Groups
- scientific article; zbMATH DE number 7370601 (Why is no real title available?)
- scientific article; zbMATH DE number 7765400 (Why is no real title available?)
- scientific article; zbMATH DE number 176397 (Why is no real title available?)
- Finding a mediocre player
- Select with groups of 3 or 4
- External selection
- A selectable sloppy heap
This page was built for publication: Progress in selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5054828)