Integer merging on EREW PRAM
From MaRDI portal
Publication:644851
DOI10.1007/s00607-010-0124-xzbMath1252.68342OpenAlexW2073378733MaRDI QIDQ644851
Publication date: 7 November 2011
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-010-0124-x
Related Items (max. 100)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal merging and sorting on the EREW PRAM
- On parallel integer merging
- Recognizing and representing proper interval graphs in parallel using merging and sorting
- A complexity theory of efficient parallel algorithms
- Parallel merging: Algorithm and implementation results
- A note on time-bounded bottom-up pyramid cellular acceptors
- Routing, merging, and sorting on parallel models of computation
- An optimal parallel algorithm for merging using multiselection
- Fast integer merging on the EREW PRAM
- Searching, Merging, and Sorting in Parallel Computation
- Finding the maximum, merging, and sorting in a parallel computation model
- Merging on the BSP model
This page was built for publication: Integer merging on EREW PRAM