Black-box reduction turns any T(n, m_in, m_out)-time sparse matrix multiplication algorithm into a robust version approximating the k largest outputs in Õ(T(n, m_in, k)) time.
19 Humberto Madrid de La Vega, Valia Guerra, and Marielba Rojas
1 Pith paper cite this work, alongside 149 external citations. Polarity classification is still indexing.
1
Pith paper citing it
149
external citations · external index
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Robustifying Sparse Matrix Multiplication
Black-box reduction turns any T(n, m_in, m_out)-time sparse matrix multiplication algorithm into a robust version approximating the k largest outputs in Õ(T(n, m_in, k)) time.