On parallel integer merging
From MaRDI portal
Publication:690247
Recommendations
- Parallel merging: Algorithm and implementation results
- On parallel integer sorting
- Parallel algorithms for merging and sorting
- Parallel merging on the instruction systolic array
- Merging by the parallel binary search algorithm
- Space-efficient parallel merging
- An optimal parallel algorithm for merging using multiselection
- The parallel odd-even merge algorithm
- scientific article; zbMATH DE number 2087747
Cited in
(20)- Parallel algorithms for merging and sorting
- Integer merging on EREW PRAM
- Merging on the BSP model
- Prefix graphs and their applications
- Optimal parallel string algorithms: sorting, merging and computing the minimum
- scientific article; zbMATH DE number 6117286 (Why is no real title available?)
- Improved parallel integer sorting without concurrent writing
- Fast integer merging on the EREW PRAM
- More general parallel tree contraction: register allocation and broadcasting in a tree
- Fast integer merging on the EREW PRAM
- Merging and sorting strings in parallel
- Space-efficient parallel merging
- scientific article; zbMATH DE number 3868588 (Why is no real title available?)
- Perfectly load-balanced, stable, synchronization-free parallel merge
- Parallel algorithms for separable permutations
- ON COST-OPTIMAL MERGE OF TWO INTRANSITIVE SORTED SEQUENCES
- scientific article; zbMATH DE number 1760030 (Why is no real title available?)
- Parallel merging with restriction
- Parallel Merge Sort
- More general parallel tree contraction: Register allocation and broadcasting in a tree
This page was built for publication: On parallel integer merging
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690247)
