A complexity theory of efficient parallel algorithms
- 1 March 1990
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 71 (1), 95-132
- https://doi.org/10.1016/0304-3975(90)90192-k
Abstract
No abstract availableKeywords
This publication has 60 references indexed in Scilit:
- Optimal parallel selection has complexity O(Log Log N)Journal of Computer and System Sciences, 1989
- Efficient synchronization of multiprocessors with shared memoryACM Transactions on Programming Languages and Systems, 1988
- The complexity of parallel searchJournal of Computer and System Sciences, 1988
- How to share memory in a distributed systemJournal of the ACM, 1987
- Complexity Results for Permuting Data and Other Computations on Parallel ProcessorsJournal of the ACM, 1984
- Bounding Fan-out in Logical NetworksJournal of the ACM, 1984
- Efficient parallel algorithms for some graph problemsCommunications of the ACM, 1982
- An O(logn) parallel connectivity algorithmJournal of Algorithms, 1982
- On describing the behavior and implementation of distributed systemsTheoretical Computer Science, 1981
- UltracomputersACM Transactions on Programming Languages and Systems, 1980