Fast sparse matrix multiplication

DOI10.1145/1077464.1077466MaRDI QIDQ2944486zbMATH OpenOpenAlexFDO

Authors Raphael Yuster, Uri Zwick

Publication date 2 September 2015

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1077464.1077466

zbMATH Keywords

sparse matricesmatrix multiplication

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Recommendations

• Algorithms – ESA 2004
• Fast Output-Sensitive Matrix Multiplication
• A note on the multiplication of sparse matrices
• The input/output complexity of sparse matrix multiplication
• Fast multiplication and sparse structures

Cited in

(36)

• Fast Output-Sensitive Matrix Multiplication
• Compressed matrix multiplication
• Reciprocal mass matrices and a feasible time step estimator for finite elements with Allman's rotations
• On optimizing multiplications of sparse matrices
• Path Laplacian matrices: introduction and application to the analysis of consensus in networks
• New ideas in sparse matrix matrix multiplication
• Fast multiplication of matrices over a finitely generated semiring
• Fine-Grained Complexity of Regular Path Queries
• Compressed matrix multiplication
• Quantum algorithm for estimating largest eigenvalues
• An optimized sparse approximate matrix multiply for matrices with decay
• Fast multiplication and sparse structures
• Algorithms – ESA 2004
• Fast matrix multiplication and its algebraic neighbourhood
• Trait level analysis of multitrait population projection matrices
• Revisiting ``Computation of matrix chain products
• A note on compressed sensing and the complexity of matrix multiplication
• Skew-polynomial-sparse matrix multiplication
• \texttt{pylspack}: parallel algorithms and data structures for sketching, column subset selection, regression, and leverage scores
• Improving compressed matrix multiplication using control variate method
• The cost of compositionality: a high-performance implementation of string diagram composition
• Sparse matrix multiplication and triangle listing in the congested clique model
• Fast multiplication algorithm for square sparse matrices. Application toimages processing
• Bounds and algorithms for graph trusses
• Fast quantum subroutines for the simplex method
• The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
• Cache oblivious sparse matrix multiplication
• Incremental distance products via faulty shortest paths
• Brief announcement: Hamming distance completeness and sparse matrix multiplication
• Sparse matrix multiplication and triangle listing in the congested clique model
• Decreased coherence and functional connectivity of electroencephalograph in Alzheimer's disease
• Sparse matrix multiplication package (SMMP)
• Fractal-like matrices
• scientific article; zbMATH DE number 139779 (Why is no real title available?)
• scientific article; zbMATH DE number 1218794 (Why is no real title available?)
• A note on the multiplication of sparse matrices

This page was built for publication: Fast sparse matrix multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944486)