Fast integer merging on the EREW PRAM
From MaRDI portal
Publication:5204327
DOI10.1007/3-540-55719-9_84zbMath1425.68449OpenAlexW1574180925MaRDI QIDQ5204327
Torben Hagerup, Mirosław Kutyłowski
Publication date: 4 December 2019
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55719-9_84
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Optimal merging and sorting on the EREW PRAM
- 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
- On Parallel Searching
- Deterministic coin tossing with applications to optimal parallel list ranking
- Parallel Merge Sort
- Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
- Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
This page was built for publication: Fast integer merging on the EREW PRAM
