Fast and optimal simulations between CRCW PRAMs

DOI10.1007/3-540-55210-3_172zbMath1493.68144OpenAlexW1490332863MaRDI QIDQ5096768

Torben Hagerup

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (2)

Retrieval of scattered information by EREW, CREW and CRCW PRAMs ⋮ On a compaction theorem of Ragde

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Fast and optimal simulations between CRCW PRAMs