Skip to content

Author

Omar Graia

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

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.

Omar Graia · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.