Retrieval of scattered information by EREW, CREW and CRCW PRAMs
From MaRDI portal
Publication:5056126
DOI10.1007/3-540-55706-7_3zbMath1502.68357OpenAlexW1934121045MaRDI QIDQ5056126
Mirosław Kutyłowski, Krzysztof Loryś, Mirosław Kowaluk, Faith E. Fich, Prabhakar Ragde
Publication date: 9 December 2022
Published in: Algorithm Theory — SWAT '92 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55706-7_3
Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10) Information storage and retrieval of data (68P20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact lower time bounds for computing Boolean functions on CREW PRAMs
- Approximate formulas for some functions of prime numbers
- 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
- Fast and optimal simulations between CRCW PRAMs