The following pages link to Deterministic parallel list ranking (Q808699):
Displaying 13 items.
- An efficient parallel algorithm for building the separating tree (Q666141) (← links)
- A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles (Q1195493) (← links)
- More general parallel tree contraction: Register allocation and broadcasting in a tree (Q1274316) (← links)
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488) (← links)
- A time-optimal solution for the path cover problem on cographs. (Q1401176) (← links)
- List-ranking on interconnection networks. (Q1401927) (← links)
- An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs (Q1607053) (← links)
- Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree (Q1816995) (← links)
- An optimal parallel algorithm for planar cycle separators (Q1900892) (← links)
- Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM (Q1917253) (← links)
- Data independence of read, write, and control structures in PRAM computations (Q1975968) (← links)
- Conservative algorithms for parallel and sequential integer sorting (Q6085719) (← links)
- More Efficient Parallel Integer Sorting (Q6114876) (← links)
