| A refined laser method and faster matrix multiplication J Alman, VV Williams Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 396 | 2021 |
| Probabilistic polynomials and hamming nearest neighbors J Alman, R Williams 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 136-150, 2015 | 128 | 2015 |
| Polynomial representations of threshold functions and algorithmic applications J Alman, TM Chan, R Williams 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 101 | 2016 |
| Probabilistic rank and matrix rigidity J Alman, R Williams Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 50 | 2017 |
| Limits on all known (and some unknown) approaches to matrix multiplication J Alman, VV Williams SIAM Journal on Computing, FOCS18-285-FOCS18-315, 2021 | 46 | 2021 |
| Limits on the universal method for matrix multiplication J Alman arXiv preprint arXiv:1812.08731, 2018 | 38 | 2018 |
| Further limitations of the known approaches for matrix multiplication J Alman, VV Williams arXiv preprint arXiv:1712.07246, 2017 | 36 | 2017 |
| Efficient construction of rigid matrices using an NP oracle J Alman, L Chen SIAM Journal on Computing, FOCS19-102-FOCS19-134, 2022 | 32 | 2022 |
| Dynamic Parameterized Problems and Algorithms M Mnich, V Vassilevska Williams, J Alman ACM Transactions on Algorithms (TALG), 2020 | 25* | 2020 |
| An illuminating algorithm for the light bulb problem J Alman arXiv preprint arXiv:1810.06740, 2018 | 22 | 2018 |
| Laurent Phenomenon Sequences J Alman, C Cuenca, J Huang Journal of Algebraic Combinatorics 43 (3), 589–633, 2015 | 22 | 2015 |
| Circular planar electrical networks: Posets and positivity J Alman, C Lian, B Tran Journal of Combinatorial Theory, Series A 132, 58-101, 2015 | 20* | 2015 |
| Algorithms and hardness for linear algebra on geometric graphs J Alman, T Chu, A Schild, Z Song 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 15 | 2020 |
| Fast attention requires bounded entries J Alman, Z Song arXiv preprint arXiv:2302.13214, 2023 | 12 | 2023 |
| Theoretical foundations of team matchmaking J Alman, D McKay Proceedings of the 16th Conference on Autonomous Agents and MultiAgent …, 2017 | 10 | 2017 |
| Faster deterministic and Las Vegas algorithms for offline approximate nearest neighbors in high dimensions J Alman, TM Chan, R Williams Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 9 | 2020 |
| Kronecker products, low-depth circuits, and matrix rigidity J Alman Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 7 | 2021 |
| Bypass Exponential Time Preprocessing: Fast Neural Network Training via Weight-Data Correlation Preprocessing J Alman, J Liang, Z Song, R Zhang, D Zhuo arXiv preprint arXiv:2211.14227, 2022 | 6 | 2022 |
| OV graphs are (probably) hard instances J Alman, V Vassilevska Williams 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020 | 4 | 2020 |
| Faster update time for turnstile streaming algorithms J Alman, H Yu Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 4 | 2020 |
