Optimal randomized parallel algorithms for computing the row maxima of a totally monotone matrix

Authors:
Rajeev Raman;Uzi Vishkin
Affiliations:
UMIACS, University of Maryland, College Park, MD;UMIACS, University of Maryland, College Park, MD
Venue:
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Year:
1994

Citing 8
Cited 0

Exact time bounds for computing boolean functions on PRAMs without simultaneous writes

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Efficient parallel algorithms for string editing and related problems

SIAM Journal on Computing
The average complexity of parallel comparison merging

SIAM Journal on Computing
An introduction to parallel algorithms

An introduction to parallel algorithms
On a compaction theorem of Ragde

Information Processing Letters
Recursive star-tree parallel data structure

SIAM Journal on Computing
The parallel simplicity of compaction and chaining

Journal of Algorithms
An efficient parallel algorithm for the row minima of a totally monotone matrix

Journal of Algorithms

Quantified Score

Hi-index	0.01

Visualization

Abstract