Skip to Main Content
Home
  • About
  • People
  • Sponsors
  • Publications
  • Talks
  • Media
  • Research
  • Login

About Par Lab

  • Get Involved
  • Come Visit
  • Seminars
  • Contact
  • Research Projects
  • 2012 Short Course on Parallel Programming
  • 2011 Short Course on Parallel Programming
  • 2010 Short Course on Parallel Programming
  • 2009 Short Course on Parallel Programming
  • Par Lab's End of Project Celebration May 30, 2013

Par Lab Spotlight

  • Par Lab's End of Project Celebration May 30, 2013
  • Mangpo Phothilimthana and Nishant Tolta Win 2013 Qualcomm Innovations Fellowship
  • Armando Fox on the PBS NewsHour: How Free Online Courses are Changing the Traditional Liberal Arts Education
  • Par Lab's Leo Meyerovich Featured in Wired.com Article: Why Do Some Programming Languages Live and Others Die?
  • Grey Ballard Winner of C.V. Ramamoorthy Distinguished Research Award
  • 1
  • 2
  • 3
  • next ›
  • last »

Communication-Optimal Parallel Algorithm for Strassen’s Matrix Multiplication

TitleCommunication-Optimal Parallel Algorithm for Strassen’s Matrix Multiplication
Publication TypeConference Paper
AuthorsBallard, G., Demmel J., Holtz O., Lipshitz B., & Schwartz O.
AttachmentSize
Communitation Optimal Parallel Algorithms for Strassens Matrix Multiplication- Demmel.pdf575.19 KB
  • Site Map
  • Accessibility
  • Site Credit
  • Internal
© 2012 The Regents of the University of California. All Rights Reserved.