Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity

Chetan Gupta, Janne H. Korhonen, Jan Studený +2

In prior work, Gupta et al. (SPAA 2022) presented a distributed algorithm for multiplying sparse $n\times n$ matrices, using $n$ computers. They assumed that the input matrices ar…