Cache Oblivious Sparse Matrix Multiplication
- 13 March 2018
- book chapter
- Published by Springer Nature
- p. 437-447
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Powers of tensors and fast matrix multiplication2014
- A note on compressed sensing and the complexity of matrix multiplicationInformation Processing Letters, 2009
- Faster join-projects and sparse matrix multiplications2009
- A Fast Output-Sensitive Algorithm for Boolean Matrix MultiplicationLecture Notes in Computer Science, 2009
- Fundamental parallel algorithms for private-cache chip multiprocessors2008
- Concurrent cache-oblivious b-trees2005
- Fast sparse matrix multiplicationACM Transactions on Algorithms, 2005
- Cache-oblivious algorithms1999
- The input/output complexity of sorting and related problemsCommunications of the ACM, 1988
- Gaussian elimination is not optimalNumerische Mathematik, 1969