Fast sparse matrix multiplication
From MaRDI portal
Publication:2944486
DOI10.1145/1077464.1077466zbMATH Open1321.65073OpenAlexW2043670592MaRDI QIDQ2944486FDOQ2944486
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
Recommendations
Cited In (37)
- Reciprocal mass matrices and a feasible time step estimator for finite elements with Allman's rotations
- On optimizing multiplications of sparse matrices
- New ideas in sparse matrix matrix multiplication
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- Fine-Grained Complexity of Regular Path Queries
- Compressed matrix multiplication
- Fast multiplication of matrices over a finitely generated semiring
- Title not available (Why is that?)
- Quantum algorithm for estimating largest eigenvalues
- An optimized sparse approximate matrix multiply for matrices with decay
- Algorithms – ESA 2004
- Fast matrix multiplication and its algebraic neighbourhood
- Fast multiplication and sparse structures
- Revisiting ``Computation of matrix chain products
- Trait level analysis of multitrait population projection matrices
- 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
- Better size estimation for sparse matrix products
- 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)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fractal-like matrices
- Fast Output-Sensitive Matrix Multiplication
- A note on the multiplication of sparse matrices
- Compressed matrix multiplication
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)
