Parallel algorithms for partitioning sorted sets and related problems
From MaRDI portal
Publication:1580962
DOI10.1007/S004530010037zbMATH Open0960.68176OpenAlexW2055268457MaRDI QIDQ1580962FDOQ1580962
Authors: Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi 
Publication date: 20 May 2001
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004530010037
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recursively divisible problems
- Parallel algorithms for select and partition with noisy comparisons
- Parallel methods for solving fundamental file rearrangement problems
- Title not available (Why is that?)
- 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)
