Parallel algorithms for partitioning sorted sets and related problems

DOI10.1007/3-540-61680-2_59zbMATH Open1379.68334OpenAlexW1938870663MaRDI QIDQ4595490FDOQ4595490

Authors: Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi 

Publication date: 5 December 2017

Published in: Algorithms — ESA '96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61680-2_59

Recommendations

• Parallel algorithms for partitioning sorted sets and related problems
• An efficient parallel sorting algorithm
• Parallel algorithms for merging and sorting
• Probabilistic Parallel Algorithms for Sorting and Selection
• scientific article; zbMATH DE number 1487619

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Cited In (16)

• Parallel algorithms for partitioning sorted sets and related problems
• Two-variable linear programming in parallel
• Parallel algorithms for evaluating sequences of set-manipulation operations
• EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS*
• A sequential aggregation algorithm for the set partitioning problem
• Approximation algorithms for array partitioning problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Parallel algorithms for separable permutations
• An efficient parallel algorithm for the single function coarsest partition problem
• Parallel algorithms for select and partition with noisy comparisons
• Parallel partitioning for distributed systems using sequential assignment
• Two-variable linear programming in parallel
• Parallel methods for solving fundamental file rearrangement problems
• Analyzing a class of distributive partitioning sort algorithms
• Parallel algorithms for arrangements

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)