Simulation of Parallel Random Access Machines by Circuits
- 1 May 1984
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 13 (2), 409-422
- https://doi.org/10.1137/0213027
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Constant Depth ReducibilitySIAM Journal on Computing, 1984
- Parallel time O(log N) acceptance of deterministic CFLsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- A complexity theory for unbounded fan-in parallelismPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- A universal interconnection pattern for parallel computersJournal of the ACM, 1982
- A fast parallel algorithm for routing in permutation networksIEEE Transactions on Computers, 1981
- AlternationJournal of the ACM, 1981
- Relations Among Complexity MeasuresJournal of the ACM, 1979
- Parallelism in random access machinesPublished by Association for Computing Machinery (ACM) ,1978
- On Relating Time and Space to Size and DepthSIAM Journal on Computing, 1977
- A characterization of the power of vector machinesJournal of Computer and System Sciences, 1976