PRAM's towards realistic parallelism: BRAM's
From MaRDI portal
Publication:5055910
DOI10.1007/3-540-60249-6_68OpenAlexW1482294627MaRDI QIDQ5055910
Rolf Niedermeier, Peter Rossmanith
Publication date: 9 December 2022
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60249-6_68
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)
Cites Work
- Communication complexity of PRAMs
- A complexity theory of efficient parallel algorithms
- Sorting in \(c \log n\) parallel steps
- Complexity Results for Permuting Data and Other Computations on Parallel Processors
- Parallel Merge Sort
- Locality, Communication, and Interconnect Length in Multicomputers
- Optimal average case sorting on arrays
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item