Limitations of the QRQW and EREW PRAM models
From MaRDI portal
Publication:6567781
DOI10.1007/3-540-62034-6_59zbMATH Open1541.68146MaRDI QIDQ6567781FDOQ6567781
Authors: Mirosław Kutyłowski, Krzysztof Loryś 
Publication date: 5 July 2024
Recommendations
- scientific article; zbMATH DE number 1003297
- The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
- Lower bounds for randomized exclusive write PRAMs
- Retrieval of scattered information by EREW, CREW, and CRCW PRAMs
- Limits on the power of parallel random access machines with weak forms of write conflict resolution
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)
Cites Work
- A Remark on Stirling's Formula
- Title not available (Why is that?)
- Exact lower time bounds for computing Boolean functions on CREW PRAMs
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- Optimal bounds for decision problems on the CRCW PRAM
- Title not available (Why is that?)
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Title not available (Why is that?)
- Retrieval of scattered information by EREW, CREW, and CRCW PRAMs
This page was built for publication: Limitations of the QRQW and EREW PRAM models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567781)
