A Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard, University of California at Berkeley James Demmel, University of California at Berkeley ¨ Berlin

First Page		Document Content
Date: 2014-11-26 08:31:39 Mathematics Algebra Computational complexity theory Analysis of algorithms Multiplication Numerical linear algebra Matrix multiplication algorithm Matrix multiplication Strassen algorithm Fast Fourier transform Multiplication algorithm Algorithm		A Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard, University of California at Berkeley James Demmel, University of California at Berkeley ¨ Berlin Add to Reading List Source URL: www.cs.huji.ac.il Download Document from Source Website File Size: 465,15 KB Share Document on Facebook

	An Asynchronous, Iterative Implementation of the Original Booth Multiplication Algorithm A. Efthymiou W. Suntiamorntut DocID: 1u1aw - View Document
	Fast Integer Multiplication with ¨ Schonhage-Strassen’s Algorithm Alexander Kruppa CACAO team at LORIA, Nancy DocID: 1sjaC - View Document
	Design of Parallel and High Performance Computing HS 2013 Markus P¨ uschel, Torsten Hoefler Department of Computer Science ETH Zurich DocID: 1rlc8 - View Document
	A Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard, University of California at Berkeley James Demmel, University of California at Berkeley ¨ Berlin DocID: 1rgSV - View Document
	Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard ∗ James Demmel † DocID: 1rcVB - View Document