A BSP realisation of Strassen's algorithm

Authors:
W. F. McColl
Affiliations:
Oxford Univ., Oxford, UK
Venue:
Abstract machine models for parallel and distributed computing
Year:
1997

Citing 0
Cited 2

All-Pairs Shortest Paths Computation in the BSP Model

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Communication-efficient parallel generic pairwise elimination

Future Generation Computer Systems - Special section: Information engineering and enterprise architecture in distributed computing environments

Quantified Score

Hi-index	0.00

Visualization

Abstract