Sign In

Communications of the ACM

Research Archive


Archives

The Research archive provides access to all Research articles published in past issues of Communications of the ACM.

February 2014


From Communications of the ACM

Communication Costs of Strassen's Matrix Multiplication

Communication Costs of Strassen's Matrix Multiplication

Proving lower bounds on the communication of algorithms and finding algorithms that attain these bounds are fundamental goals. 


From Communications of the ACM

Technical Perspective: A New Spin on an Old Algorithm

A paper by Ballard, Demmel, Holtz, and Schwartz considers a fundamental problem, adopting a new perspective on an old algorithm that has for years occupied a peculiar place in the theory and practice of matrix algorithms.