Fast and optimal simulations between CRCW PRAMs
From MaRDI portal
Publication:5096768
DOI10.1007/3-540-55210-3_172zbMath1493.68144MaRDI QIDQ5096768
Publication date: 18 August 2022
Published in: STACS 92 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55210-3_172
68Q25: Analysis of algorithms and problem complexity
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
Related Items
Cites Work
- Optimal parallel algorithms on planar graphs
- A guided tour of Chernoff bounds
- Simulations among concurrent-write PRAMs
- Parallel computation and conflicts in memory access
- Improved deterministic parallel integer sorting
- Faster optimal parallel prefix sums and list ranking
- Erratum and addendum to: parallel computation and conflicts in memory access
- Probabilistic Parallel Algorithms for Sorting and Selection
- Relations between Concurrent-Write Models of Parallel Computation
- Finding the maximum, merging, and sorting in a parallel computation model
- A universal interconnection pattern for parallel computers
- An O(logn) parallel connectivity algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item