Algorithms for the parallel alternating direction access machine
From MaRDI portal
Publication:1575740
DOI10.1016/S0304-3975(99)00280-7zbMath0946.68047OpenAlexW2056181277MaRDI QIDQ1575740
Mirosław Kowaluk, Artur Czumaj, Bogdan S. Chlebus, Wojciech Plandowski, Leszek Gąsieniec
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00280-7
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
- A complexity theory of efficient parallel algorithms
- Time bounds for selection
- A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues
- Mesh-Connected Computers with Broadcasting
- Deterministic Permutation Routing on Meshes
- An orthogonal multiprocessor for parallel scientific computations
This page was built for publication: Algorithms for the parallel alternating direction access machine