Parallel algorithms for partitioning sorted sets and related problems
From MaRDI portal
Publication:4595490
Recommendations
Cited in
(18)- Approximation algorithms for array partitioning problems
- Two-variable linear programming in parallel
- Parallel algorithms for partitioning sorted sets and related problems
- An efficient parallel algorithm for the single function coarsest partition problem
- Analyzing a class of distributive partitioning sort algorithms
- scientific article; zbMATH DE number 3997175 (Why is no real title available?)
- scientific article; zbMATH DE number 4060711 (Why is no real title available?)
- Fast and efficient parallel coarsest refinement
- Parallel algorithms for evaluating sequences of set-manipulation operations
- Parallelizing a new algorithm for the set partition problem
- Parallel methods for solving fundamental file rearrangement problems
- A sequential aggregation algorithm for the set partitioning problem
- Parallel algorithms for select and partition with noisy comparisons
- Parallel partitioning for distributed systems using sequential assignment
- EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS*
- Parallel algorithms for separable permutations
- Parallel algorithms for arrangements
- Two-variable linear programming in parallel
This page was built for publication: Parallel algorithms for partitioning sorted sets and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595490)