BibTeX
CSL-JSON
MLA
Harvard
Communication-optimal parallel algorithm for strassen's matrix multiplication
release_imvcz6bgsfho3px3hqgy4xs6jm
by
Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz
Published
in ACM Symposium on Parallelism in Algorithms and Architectures by ACM Press.
2012 p193-204
Archived Files and Locations
application/pdf 589.0 kB
file_2577nqw5zvhvjl4r3tim66cvpy
|
parlab.eecs.berkeley.edu (web) web.archive.org (webarchive) |
application/pdf 841.7 kB
file_2cztxxpgazdirpfvo3e6aj3jge
|
www.sandia.gov (web) web.archive.org (webarchive) |
application/pdf 645.1 kB
file_azxcqamwfbdjlbcqu4tyq4g4s4
|
web.archive.org (webarchive) digitalassets.lib.berkeley.edu (web) |
application/pdf 748.5 kB
file_ooeinpu5d5hnlm6jfprwzbjs7m
|
web.archive.org (webarchive) www.csd.uwo.ca (web) |
application/pdf 587.2 kB
file_2zxyxr4h6nddno6dpuiujrffh4
|
people.eecs.berkeley.edu (web) www.cs.berkeley.edu (web) web.archive.org (webarchive) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
Type
Stage
Year 2012
paper-conference
Stage
published
Year 2012
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links
oaDOI/unpaywall (OA fulltext)
Crossref Metadata (via API)
Worldcat
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar
Crossref Metadata (via API)
Worldcat
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar