Abstract
Algorithms for multiplying several types of sparse n x n-matrices on dynamically
reconfigurable n x n-arrays are presented. For some classes of sparse matrices constant
time algorithms are given, e.g., when the first matrix has at most kn elements in each
column or in each row and the second matrix has at most kn nonzero elements in each
row, where k is a constant. Moreover, O(k