| Publication | Date of Publication | Type |
|---|
| Finer-grained hardness of kernel density estimation | 2026-01-28 | Paper |
| Fine-grained complexity in a world without cryptography | 2025-12-02 | Paper |
| Tensor ranks and the fine-grained complexity of dynamic programming | 2025-11-04 | Paper |
Efficient construction of rigid matrices using an NP oracle
SIAM Journal on Computing | 2025-09-16 | Paper |
| Generalizations of matrix multiplication can solve the light bulb problem | 2025-08-15 | Paper |
| Algorithms and hardness for linear algebra on geometric graphs | 2025-08-12 | Paper |
| Efficient construction of rigid matrices using an NP oracle | 2025-08-12 | Paper |
| Limits on all known (and some unknown) approaches to matrix multiplication | 2025-08-12 | Paper |
| Polynomial representations of threshold functions and algorithmic applications | 2025-08-06 | Paper |
| Probabilistic polynomials and Hamming nearest neighbors | 2025-08-05 | Paper |
| Matrix multiplication and number on the forehead communication | 2024-11-19 | Paper |
A refined laser method and faster matrix multiplication
TheoretiCS | 2024-09-10 | Paper |
| An illuminating algorithm for the light bulb problem | 2024-08-26 | Paper |
| Optimal-degree polynomial approximations for exponentials and Gaussian kernel density estimation | 2024-07-05 | Paper |
| Parameterized sensitivity oracles and dynamic algorithms using exterior algebras | 2024-06-24 | Paper |
| Smaller low-depth circuits for Kronecker powers | 2024-05-14 | Paper |
| Faster Walsh-Hadamard transform and matrix multiplication over finite fields using lookup tables | 2024-05-14 | Paper |
| Faster Walsh-Hadamard and discrete Fourier transforms from matrix non-rigidity | 2024-05-08 | Paper |
scientific article; zbMATH DE number 7788370 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
SIAM Journal on Computing | 2023-12-19 | Paper |
Kronecker products, low-depth circuits, and matrix rigidity
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Dynamic Parameterized Problems and Algorithms
ACM Transactions on Algorithms | 2023-04-26 | Paper |
| scientific article; zbMATH DE number 7650431 (Why is no real title available?) | 2023-02-03 | Paper |
| Limits on the Universal method for matrix multiplication | 2022-07-27 | Paper |
| Optimal-Degree Polynomial Approximations for Exponentials and Gaussian Kernel Density Estimation | 2022-05-12 | Paper |
Efficient Construction of Rigid Matrices Using an NP Oracle
SIAM Journal on Computing | 2022-03-11 | Paper |
Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
SIAM Journal on Computing | 2022-01-07 | Paper |
Limits on the universal method for matrix multiplication
Theory of Computing | 2021-10-25 | Paper |
Further limitations of the known approaches for matrix multiplication
(available as arXiv preprint) | 2021-06-15 | Paper |
Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High Dimensions
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Faster Update Time for Turnstile Streaming Algorithms
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
| Metric Transforms and Low Rank Matrices via Representation Theory of the Real Hyperrectangle | 2020-11-23 | Paper |
Dynamic parameterized problems and algorithms
(available as arXiv preprint) | 2020-05-27 | Paper |
| Predicate encryption from bilinear maps and one-sided probabilistic rank | 2020-04-30 | Paper |
Cell-probe lower bounds from online communication complexity
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Limits on the Universal Method for Matrix Multiplication
(available as arXiv preprint) | 2018-12-20 | Paper |
Probabilistic rank and matrix rigidity
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
| Probabilistic Polynomials and Hamming Nearest Neighbors | 2015-07-17 | Paper |
