A parallel algorithm for the maximal path problem

Authors:
R Anderson
Affiliations:
Computer Science Department, Stanford University, Stanford, California
Venue:
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Year:
1985

Citing 3
Cited 1

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
A fast parallel algorithm for the maximal independent set problem

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Parallelism and greedy algorithms

Parallelism and greedy algorithms

Efficient Parallel Pseudo-Random Number Generation

CRYPTO '85 Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract