Pages that link to "Item:Q1108805"
From MaRDI portal
The following pages link to An optimally efficient selection algorithm (Q1108805):
Displaying 15 items.
- Optimal parallel selection in sorted matrices (Q671400) (← links)
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms (Q758188) (← links)
- On parallel integer sorting (Q805234) (← links)
- Finding an approximate median with high probability in constant parallel time (Q911292) (← links)
- An optimal parallel algorithm for linear programming in the plane (Q915450) (← links)
- Efficient parallel algorithms for r-dominating set and p-center problems on trees (Q1262780) (← links)
- Optimal parallel construction of heaps (Q1313734) (← links)
- Optimal, output-sensitive algorithms for constructing planar hulls in parallel (Q1367171) (← links)
- Selecting small ranks in EREW PRAM (Q1606990) (← links)
- Improved fast integer sorting in linear space (Q1854461) (← links)
- Improving the efficiency of parallel minimum spanning tree algorithms (Q1861567) (← links)
- Fast deterministic selection on mesh-connected processor arrays (Q1911464) (← links)
- Finding the k shortest paths in parallel (Q5048947) (← links)
- Improved upper bounds for time-space tradeoffs for selection with limited storage (Q5054849) (← links)
- Two-variable linear programming in parallel (Q5054853) (← links)
