Pages that link to "Item:Q5687655"
From MaRDI portal
The following pages link to SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS (Q5687655):
Displaying 15 items.
- Parallel skyline queries (Q269332) (← links)
- Randomized parallel list ranking for distributed memory multiprocessors. (Q676261) (← links)
- A coarse-grained multicomputer algorithm for the detection of repetitions (Q835058) (← links)
- Algorithms for maximum independent set in convex bipartite graphs (Q1017904) (← links)
- Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model (Q1274330) (← links)
- 1-optimality of static BSP computations: Scheduling independent chains as a case study. (Q1401163) (← links)
- Graph coloring on coarse grained multicomputers (Q1408826) (← links)
- Sorting signed permutations by reversals, revisited (Q1775771) (← links)
- Solving large FPT problems on coarse-grained parallel machines (Q1877701) (← links)
- Efficient parallel graph algorithms for coarse grained multicomputers and BSP (Q4571970) (← links)
- The deterministic complexity of parallel multisearch (Q5054831) (← links)
- Coarse Grained Parallel Selection (Q5087083) (← links)
- Algorithm 947 (Q5270708) (← links)
- A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions (Q5929327) (← links)
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs (Q6168083) (← links)
