Retrieval of scattered information by EREW, CREW, and CRCW PRAMs

DOI10.1007/BF01268141zbMath0838.68052OpenAlexW2063871359MaRDI QIDQ1904664

Faith E. Fich, Mirosław Kowaluk, Prabhakar Ragde, Mirosław Kutyłowski, Krzysztof Loryś

Publication date: 27 May 1996

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01268141

zbMATH Keywords

\(k\)-compaction problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Related Items (2)

ERCW PRAMs and optical communication ⋮ The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Exact lower time bounds for computing Boolean functions on CREW PRAMs
• Approximate formulas for some functions of prime numbers
• Time Complexity of Boolean Functions on CREW PRAM<scp>s</scp>
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• On Parallel Searching
• Parallel Merge Sort
• Relations between Concurrent-Write Models of Parallel Computation
• On parallel hashing and integer sorting
• The Parallel Simplicity of Compaction and Chaining

This page was built for publication: Retrieval of scattered information by EREW, CREW, and CRCW PRAMs