@inproceedings{5a8419f929da46e4aec7ff88c0381a98,
title = "Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication",
abstract = "Graph expansion analysis of computational DAGs is useful for obtaining communication cost lower bounds where previous methods, such as geometric embedding, are not applicable. This has recently been demonstrated for Strassen{\textquoteright}s and Strassen-like fast square matrix multiplication algorithms. Here we extend the expansion analysis approach to fast algorithms for rectangular matrix multiplication, obtaining a new class of communication cost lower bounds. These apply, for example to the algorithms of Bini et al. (1979) and the algorithms of Hopcroft and Kerr (1971). Some of our bounds are proved to be optimal.",
author = "Grey Ballard and James Demmel and Olga Holtz and Benjamin Lipshitz and Oded Schwartz",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2012.; 1st Mediterranean Conference on Algorithms, MedAlg 2012 ; Conference date: 03-12-2012 Through 05-12-2012",
year = "2012",
doi = "10.1007/978-3-642-34862-4\_2",
language = "الإنجليزيّة",
isbn = "9783642348617",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "13--36",
editor = "Guy Even and Dror Rawitz",
booktitle = "Design and Analysis of Algorithms - 1st Mediterranean Conference on Algorithms, MedAlg 2012, Proceedings",
address = "ألمانيا",
}