Pages that link to "Item:Q1118404"
From MaRDI portal
The following pages link to Optimal parallel selection has complexity O(log log N) (Q1118404):
Displaying 9 items.
- Transforming comparison model lower bounds to the parallel-random-access-machine (Q287050) (← links)
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- Recursive construction for 3-regular expanders (Q1343165) (← links)
- Fast deterministic selection on mesh-connected processor arrays (Q1911464) (← links)
- A selectable sloppy heap (Q2312418) (← links)
- Select with Groups of 3 or 4 (Q3449816) (← links)
- Selection Algorithms with Small Groups (Q4983545) (← links)
- Heap construction in the parallel comparison tree model (Q5056136) (← links)
- (Q6087214) (← links)
