SIGN IN
SIGN UP
Graph expansion and communication costs of fast matrix multiplication: regular submission
Full Text:
PDF
Buy this Article
Authors:
Grey Ballard
University of California, Berkeley, Berkeley, CA, USA
James Demmel
University of California, Berkeley, Berkeley, CA, USA
Olga Holtz
University of California, Berkeley and TU-Berlin., Berkeley, CA, USA
Oded Schwartz
University of California, Berkeley, University of California, Berk, CA, USA
2011 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 73
· Downloads (cumulative): 196
· Citation Count: 6
Published in:
· Proceeding
SPAA '11
Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures
Pages 1-12
ACM
New York, NY
, USA
©2011
table of contents
ISBN: 978-1-4503-0743-7
doi>
10.1145/1989493.1989495
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SPAA '13
Share:
|
Tags:
algorithms
communication avoiding algorithms
computations on matrices
fast matrix multiplication
i/o-complexity
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder