Optimal Deterministic Fully Sparse Matrix Multiplication
The first deterministic algorithm for fully sparse matrix multiplication that attains the optimal running-time exponent is given and a general deterministic recovery technique is developed that finds and fixes sparse parts of an unknown matrix while keeping temporary errors in denser parts under control.