A complexity theory of efficient parallel algorithms
- 1 January 1988
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Deterministic Simulation of Idealized Parallel Computers on More Realistic OnesSIAM Journal on Computing, 1987
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous WritesSIAM Journal on Computing, 1986
- On Parallel SearchingSIAM Journal on Computing, 1985
- Depth-first search is inherently sequentialInformation Processing Letters, 1985
- Complexity Results for Permuting Data and Other Computations on Parallel ProcessorsJournal of the ACM, 1984
- Implementation of simultaneous memory address access in models that forbid itJournal of Algorithms, 1983
- Parallel computation and conflicts in memory accessInformation Processing Letters, 1982
- New hash functions and their use in authentication and set equalityJournal of Computer and System Sciences, 1981
- UltracomputersACM Transactions on Programming Languages and Systems, 1980
- A Machine-Independent Theory of the Complexity of Recursive FunctionsJournal of the ACM, 1967