Graph expansion and communication costs of fast matrix multiplication
From MaRDI portal
Publication:5395700
DOI10.1145/2395116.2395121zbMath1281.68241arXiv1109.1693OpenAlexW2164946224MaRDI QIDQ5395700
Grey Ballard, Oded Schwartz, O. V. Holtz, James W. Demmel
Publication date: 17 February 2014
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.1693
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
Pebbling Game and Alternative Basis for High Performance Matrix Multiplication ⋮ Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra ⋮ Algorithms and conditional lower bounds for planning problems ⋮ Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions ⋮ Algebraic methods in the congested clique ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra ⋮ Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization ⋮ Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles ⋮ Improving the Numerical Stability of Fast Matrix Multiplication
This page was built for publication: Graph expansion and communication costs of fast matrix multiplication
