Parallel pointer machines
From MaRDI portal
Publication:2366720
DOI10.1007/BF01200405zbMath0781.68052MaRDI QIDQ2366720
Patrick W. Dymond, Stephen A. Cook
Publication date: 9 February 1994
Published in: Computational Complexity (Search for Journal in Brave)
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q80: Cellular automata (computational aspects)
Related Items
Sequential and parallel algorithms for the NCA problem on pure pointer machines, Data independence of read, write, and control structures in PRAM computations
Cites Work
- A class of algorithms which require nonlinear time to maintain disjoint sets
- On nondeterminism in parallel computation
- Complexity theory of parallel time and hardware
- Tree-size bounded alternation
- On uniform circuit complexity
- Towards a complexity theory of synchronous parallel computation
- Simulation of Parallel Random Access Machines by Circuits
- On similarity and duality of computation (I)
- Storage Modification Machines
- Alternation
- A universal interconnection pattern for parallel computers
- On Relating Time and Space to Size and Depth
- Parallelism in random access machines
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item