Time Bounded Random Access Machines with Parallel Processing

Authors:
Walter J. Savitch;Michael J. Stimson
Affiliations:
Computer Science Program, Department of AP & IS, University of California, San Diego, La Jolla, CA and Mathematisch Centrum, Amsterdam;Systems Research Operation, Science Applications, Inc., La Jolla, CA
Venue:
Journal of the ACM (JACM)
Year:
1979

The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
The complexity of parallel algorithms.

The complexity of parallel algorithms.
Formal languages and their relation to automata

Formal languages and their relation to automata

Asynchronous Analysis of Parallel Dynamic Programming Algorithms

IEEE Transactions on Parallel and Distributed Systems
Symmetric Complementation

Journal of the ACM (JACM)
Symmetric complementation

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On tape versus core an application of space efficient perfect hash functions to the invariance of space

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Fuzzy context-free languages: part 2: Recognition and parsing algorithms

Theoretical Computer Science
The problem of space invariance for sequential machines

Information and Computation
Parallel algorithms

Algorithms and theory of computation handbook
Parallel computation: models and complexity issues

Algorithms and theory of computation handbook

Hi-index	0.01