The following pages link to (Q4953331):
Displaying 5 items.
- A simple randomized parallel algorithm for list-ranking (Q911268) (← links)
- Tight bounds on parallel list marking (Q1268796) (← links)
- List-ranking on interconnection networks. (Q1401927) (← links)
- Graph algorithms with small communication costs (Q1587586) (← links)
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time (Q3777447) (← links)