Optimal Parallel Algorithms for Expression Tree Evaluation and List Ranking

Authors:
Richard Cole;Uzi Vishkin
Affiliations:
-;-
Venue:
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
Year:
1988

Citing 0
Cited 3

Towards overcoming the transitive-closure bottleneck: efficient parallel algorithms for planar digraphs

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Efficient sequential and parallel algorithms for computing recovery points in trees and paths

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
O(nlog log n)-work parallel algorithms for straight-line grid embeddings of planar graphs

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures

Quantified Score

Hi-index	0.00

Visualization

Abstract