@inproceedings{31a325d33cdd4b04b8ee81b11947f031,
title = "Graph expansion and communication costs of fast matrix multiplication: Regular submission",
abstract = "The communication cost of algorithms (also known as I/O-complexity) is shown to be closely related to the expansion properties of the corresponding computation graphs. We demonstrate this on Strassen's and other fast matrix multiplication algorithms, and obtain the first lower bounds on their communication costs. For sequential algorithms these bounds are attainable and so optimal.",
keywords = "communication avoiding algorithms, fast matrix multiplication, i/o-complexity",
author = "Grey Ballard and James Demmel and Olga Holtz and Oded Schwartz",
year = "2011",
doi = "10.1145/1989493.1989495",
language = "الإنجليزيّة",
isbn = "9781450307437",
series = "Annual ACM Symposium on Parallelism in Algorithms and Architectures",
pages = "1--11",
booktitle = "SPAA'11 - Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures",
note = "23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'11 ; Conference date: 04-06-2011 Through 06-06-2011",
}