Fast sparse matrix multiplication

DOI10.1145/1077464.1077466zbMath1321.65073OpenAlexW2043670592MaRDI QIDQ2944486

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)

Related Items (18)

Fast Output-Sensitive Matrix Multiplication ⋮ Skew-polynomial-sparse matrix multiplication ⋮ Decreased coherence and functional connectivity of electroencephalograph in Alzheimer's disease ⋮ Quantum algorithm for estimating largest eigenvalues ⋮ Fine-Grained Complexity of Regular Path Queries ⋮ Path Laplacian matrices: introduction and application to the analysis of consensus in networks ⋮ Bounds and algorithms for graph trusses ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ Unnamed Item ⋮ A note on the multiplication of sparse matrices ⋮ Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication. ⋮ Trait level analysis of multitrait population projection matrices ⋮ Better size estimation for sparse matrix products ⋮ Unnamed Item ⋮ Sparse matrix multiplication and triangle listing in the congested clique model ⋮ Fast quantum subroutines for the simplex method ⋮ Revisiting “Computation of Matrix Chain Products ⋮ Incremental distance products via faulty shortest paths

This page was built for publication: Fast sparse matrix multiplication