Separation and lower bounds for ROM and nondeterministic models of parallel computation
- 1 May 1987
- journal article
- Published by Elsevier in Information and Computation
- Vol. 73 (2) , 102-128
- https://doi.org/10.1016/0890-5401(87)90017-4
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Trade-Offs between Depth and Width in Parallel ComputationSIAM Journal on Computing, 1985
- The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel ComputerIEEE Transactions on Computers, 1983
- An O(logn) parallel connectivity algorithmJournal of Algorithms, 1982
- Finding the maximum, merging, and sorting in a parallel computation modelJournal of Algorithms, 1981
- Computing connected components on parallel computersCommunications of the ACM, 1979
- A Survey of Parallel Machine Organization and ProgrammingACM Computing Surveys, 1977