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):
Displayed 8 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)
- Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers (Q4805931) (← links)