Parallel algorithms for partitioning sorted sets and related problems
From MaRDI portal
(Redirected from Publication:1580962)
Recommendations
- Parallel algorithms for partitioning sorted sets and related problems
- Parallelizing a new algorithm for the set partition problem
- Parallel distributive partitioned sorting methods
- An optimal parallel algorithm for sorting multisets
- scientific article; zbMATH DE number 3997175
- A concurrent processing framework for the set partitioning problem
- The parallel complexity of coarsest set partition problems
- Publication:4728240
- Parallel complexity of sorting problems
Cited in
(16)- Parallel algorithms for partitioning sorted sets and related problems
- Parallel algorithms for evaluating sequences of set-manipulation operations
- Parallel algorithms for merging and sorting
- Parallelizing a new algorithm for the set partition problem
- EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS*
- A sequential aggregation algorithm for the set partitioning problem
- Approximation algorithms for array partitioning problems
- Fast and efficient parallel coarsest refinement
- scientific article; zbMATH DE number 4060711 (Why is no real title available?)
- scientific article; zbMATH DE number 62667 (Why is no real title available?)
- scientific article; zbMATH DE number 3997175 (Why is no real title available?)
- Recursively divisible problems
- Parallel algorithms for select and partition with noisy comparisons
- Parallel methods for solving fundamental file rearrangement problems
- scientific article; zbMATH DE number 3958753 (Why is no real title available?)
- Analyzing a class of distributive partitioning sort algorithms
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 Q1580962)
