Pages that link to "Item:Q4571970"
From MaRDI portal
The following pages link to Efficient parallel graph algorithms for coarse grained multicomputers and BSP (Q4571970):
Displaying 8 items.
- Efficient parallel algorithms for doubly convex-bipartite graphs (Q672468) (← links)
- 1-optimality of static BSP computations: Scheduling independent chains as a case study. (Q1401163) (← links)
- Emulations between QSM, BSP and LogP: A framework for general-purpose parallel algorithm design. (Q1426213) (← links)
- Efficient parallel graph algorithms for coarse-grained multicomputers and BSP (Q1601013) (← links)
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code (Q1621690) (← links)
- Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique (Q4432861) (← links)
- Efficient parallel graph algorithms for coarse grained multicomputers and BSP (Q4571970) (← links)
- PARALLEL RANGE MINIMA ON COARSE GRAINED MULTICOMPUTERS (Q5249012) (← links)