Ballard, Grey; Demmel, James; Holtz, Olga; Schwartz, Oded Graph expansion and communication costs of fast matrix multiplication. (English) Zbl 1281.68241 J. ACM 59, No. 6, Article No. 32, 23 p. (2012). Cited in 1 ReviewCited in 10 Documents MSC: 68W40 Analysis of algorithms 65F30 Other matrix algorithms (MSC2010) 68W10 Parallel algorithms in computer science 65Y05 Parallel numerical computation Keywords:communication-avoiding algorithms; I/O-complexity; fast matrix multiplication PDFBibTeX XMLCite \textit{G. Ballard} et al., J. ACM 59, No. 6, Article No. 32, 23 p. (2012; Zbl 1281.68241) Full Text: DOI arXiv