Array processing machines: an abstract model
From MaRDI portal
Publication:1094879
DOI10.1007/BF01937352zbMath0631.68053OpenAlexW2013834840MaRDI QIDQ1094879
Jan van Leeuwen, Juraj Wiedermann
Publication date: 1987
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01937352
polynomial timepolynomial spacearray processing machinemodel of parallel computationsequential random access machine
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
A canonical form of vector machines ⋮ Optical computing ⋮ Axiomatic-like performance analysis (ALPA)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On uniform circuit complexity
- Towards a complexity theory of synchronous parallel computation
- A characterization of the power of vector machines
- Time bounded random access machines
- Simulation of Parallel Random Access Machines by Circuits
- Alternation
- A universal interconnection pattern for parallel computers
- Parallel random access machines with powerful instruction sets
- Time Bounded Random Access Machines with Parallel Processing
- Parallelism in random access machines
- Parallel Processing with the Perfect Shuffle
- Some Computer Organizations and Their Effectiveness
- An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
This page was built for publication: Array processing machines: an abstract model
