Pages that link to "Item:Q3902518"
From MaRDI portal
The following pages link to A Unified Lower Bound for Selection and Set Partitioning Problems (Q3902518):
Displaying 16 items.
- On computing an optimal permutation of ranks for multiselection (Q623154) (← links)
- Optimal parallel selection in sorted matrices (Q671400) (← links)
- Randomized selection in \(n+C+o(n)\) comparisons (Q1028991) (← links)
- A note on upper bounds for the selection problem (Q1171384) (← links)
- Errata to ``Selecting the top three elements'' by M. Aigner: A result of a computer-assisted proof search (Q1208471) (← links)
- Architecture independent parallel selection with applications to parallel priority queues (Q1399984) (← links)
- Selecting the \(k\) largest elements with parity tests (Q1975371) (← links)
- On partial sorting in restricted rounds (Q2013879) (← links)
- A selectable sloppy heap (Q2312418) (← links)
- Closing a Long-Standing Complexity Gap for Selection: V 3(42) = 50 (Q2848968) (← links)
- Select with Groups of 3 or 4 (Q3449816) (← links)
- Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers (Q4805931) (← links)
- Selection Algorithms with Small Groups (Q4983545) (← links)
- Progress in selection (Q5054828) (← links)
- Finding a mediocre player (Q5925497) (← links)
- (Q6087214) (← links)
