Fast integer merging on the EREW PRAM
From MaRDI portal
Publication:2365176
DOI10.1007/BF02523238zbMath0864.68047MaRDI QIDQ2365176
Torben Hagerup, Mirosław Kutyłowski
Publication date: 22 January 1997
Published in: Algorithmica (Search for Journal in Brave)
68W15: Distributed algorithms
Related Items
Parallel Algorithms for Colouring Vertices of Graph Using Bit Manipulation, Integer merging on EREW PRAM, Parallel merging with restriction
Cites Work
- Unnamed Item
- Optimal merging and sorting on the EREW PRAM
- On parallel integer merging
- Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm
- 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
- Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
- Sorting and Merging in Rounds
- Bounds to Complexities of Networks for Sorting and for Switching
- Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms