Showing cs.DSShow all
3 papers · 1 filter
cs.DS2025
Output-Sparse Matrix Multiplication Using Compressed Sensing
Huck Bennett, Karthik Gajulapalli, Alexander Golovnev +1
We give two algorithms for output-sparse matrix multiplication (OSMM), the problem of multiplying two matrices when their product is promised to have at mo…
cs.DS2025
Graph Inference with Effective Resistance Queries
Huck Bennett, Mitchell Black, Amir Nayyeri +1
The goal of graph inference is to design algorithms for learning properties of a hidden graph using queries to an oracle that returns information about the graph. Graph reconstruct…
cs.DS2023
Matrix Multiplication Verification Using Coding Theory
Huck Bennett, Karthik Gajulapalli, Alexander Golovnev +1
We study the Matrix Multiplication Verification Problem (MMV) where the goal is, given three matrices , , and as input, to decide whether . A classic…