ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2015


Article Details
Title: Matrix Multiplication I/O-Complexity by Path Routing
Article URLs:
Alternative Article URLs:
Authors: Jacob Scott
  • University of California at Berkeley
Olga Holtz
  • University of California at Berkeley
Oded Schwartz
  • The Hebrew University of Jerusalem
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/spaa/ScottHS15
Author Comments:

Discuss this paper and its artifacts below