Back to Results
First PageMeta Content
NP-complete problems / Combinatorial optimization / Matching / Tree / Matrix / Directed acyclic graph / Graph coloring / Expander code / Graph theory / Mathematics / Theoretical computer science


Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication Grey Ballard James Demmel Olga Holtz
Add to Reading List

Document Date: 2012-09-10 19:42:10


Open Document

File Size: 485,54 KB

Share Result on Facebook

City

Toledo / Berlin / Tiskin / /

Company

NVIDIA / Oracle / Nokia / Samsung / 3M / Intel / Microsoft / Computer Sciences / /

/

Event

Funding / /

Facility

Strassen-like square / University of California / /

IndustryTerm

recursive algorithm / parallel algorithms / base-case algorithm / matrix multiplication algorithm / inner product / square matrix multiplication algorithms / given algorithm / given recursive algorithm / sequential algorithm / scalar products / rectangular algorithms / outer product / numerical algorithms / rectangular matrix multiplication algorithms / matrix multiplication algorithms / na¨ıve recursive algorithm / /

Organization

In Section / University of California / U.S. Department of Energy / National Science Foundation / CS Division / Mathematics Department / Par Lab / Paper / EECS Department / /

Person

Benjamin Lipshitz / Benjamin Lipshitz Oded Schwartz / Olga Holtz / James Demmel / Oded Schwartz / Olga Holtz Benjamin Lipshitz Oded / /

Position

q−mp / author / mp / /

ProvinceOrState

California / /

Technology

square matrix multiplication algorithms / Hopcroft-Kerr algorithm / sequential algorithm / base-case algorithm / given algorithm / rectangular matrix multiplication algorithms / two example algorithms / corresponding parallel algorithms / na¨ıve recursive algorithm / recursive algorithm / matrix multiplication algorithms / matrix multiplication algorithm / given recursive algorithm / /

URL

http /

SocialTag