The following pages link to (Q3798226):
Displaying 17 items.
- An optimal EREW PRAM algorithm for minimum spanning tree verification (Q290239) (← links)
- Optimal parallel execution of complete binary trees and grids into most popular interconnection networks (Q672453) (← links)
- Deterministic parallel list ranking (Q808699) (← links)
- On optimal parallel computations for sequences of brackets (Q808700) (← links)
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- Parallel restructuring and evaluation of expressions (Q1185242) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
- An optimal parallel algorithm for node ranking of cographs (Q1270781) (← 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)
- Visibility with a moving point of view (Q1322569) (← links)
- Local consistency in parallel constraint satisfaction networks (Q1337684) (← links)
- Planarity testing in parallel (Q1342859) (← links)
- Parallel evaluation of arithmetic circuits (Q1365929) (← links)
- An optimal parallel algorithm for planar cycle separators (Q1900892) (← links)
- Sweep methods for parallel computational geometry (Q1907233) (← links)
- Improved parallel depth-first search in undirected planar graphs (Q5060132) (← links)
