282 citations · 531 across the 15 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DC2015★ 109 cited
Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication
Ariful Azad, Grey Ballard, Aydin Buluc +5
Sparse matrix-matrix multiplication (or SpGEMM) is a key primitive for many high-performance graph algorithms as well as for some linear solvers, such as algebraic multigrid. The s…
math.NA2015★ 2 cited
Improving the numerical stability of fast matrix multiplication
Grey Ballard, Austin R. Benson, Alex Druinsky +2
Fast algorithms for matrix multiplication, namely those that perform asymptotically fewer scalar operations than the classical algorithm, have been considered primarily of theoreti…