Fast integer merging on the EREW PRAM
From MaRDI portal
(Redirected from Publication:5204327)
Fast integer merging on the EREW PRAM (scientific article; zbMATH DE number 7139641)
Fast integer merging on the EREW PRAM (scientific article; zbMATH DE number 7139641)
Recommendations
Cites work
- Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
- Deterministic coin tossing with applications to optimal parallel list ranking
- On Parallel Searching
- Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
- Optimal merging and sorting on the EREW PRAM
- Parallel Merge Sort
- Routing, merging, and sorting on parallel models of computation
- Searching, Merging, and Sorting in Parallel Computation
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
Cited in
(11)- Parallel merging with restriction
- Improved bounds for integer sorting in the EREW PRAM model
- Fast integer merging on the EREW PRAM
- Space-efficient parallel merging
- Perfectly load-balanced, stable, synchronization-free parallel merge
- Merging data records on EREW PRAM
- scientific article; zbMATH DE number 3949727 (Why is no real title available?)
- ON COST-OPTIMAL MERGE OF TWO INTRANSITIVE SORTED SEQUENCES
- Optimal merging and sorting on the EREW PRAM
- Integer merging on EREW PRAM
- Fast rehashing in PRAM emulations
This page was built for publication: Fast integer merging on the EREW PRAM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5204327)