Parallel models of computation: An introductory survey
From MaRDI portal
Publication:916358
DOI10.1007/BF02575730zbMath0703.68040OpenAlexW2052621244MaRDI QIDQ916358
Publication date: 1989
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02575730
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On computing the determinant in small parallel time using a small number of processors
- Simulations among concurrent-write PRAMs
- On uniform circuit complexity
- Towards a complexity theory of synchronous parallel computation
- The maximum flow problem is log space complete for P
- Space-bounded reducibility among combinatorial problems
- Complete problems for deterministic polynomial time
- Relationships between nondeterministic and deterministic tape complexities
- Bounding Fan-out in Logical Networks
- Simulation of Parallel Random Access Machines by Circuits
- A taxonomy of problems with fast parallel algorithms
- Logarithmic Depth Circuits for Algebraic Functions
- Log Depth Circuits for Division and Related Problems
- Relations between Concurrent-Write Models of Parallel Computation
- Parallel Prefix Computation
- New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences
- Fast Parallel Matrix Inversion Algorithms
- On Relating Time and Space to Size and Depth
- Relations Among Complexity Measures
- Fast parallel matrix and GCD computations
- Parallelism in random access machines
This page was built for publication: Parallel models of computation: An introductory survey
