| A refined laser method and faster matrix multiplication J Alman, VV Williams TheoretiCS 3, 2024 | 722 | 2024 |
| Probabilistic polynomials and hamming nearest neighbors J Alman, R Williams 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 136-150, 2015 | 153 | 2015 |
| Fast attention requires bounded entries J Alman, Z Song Advances in Neural Information Processing Systems 36, 63117-63135, 2023 | 138 | 2023 |
| 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 | 119 | 2016 |
| More asymmetry yields faster matrix multiplication J Alman, R Duan, VV Williams, Y Xu, Z Xu, R Zhou Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025 | 113 | 2025 |
| Probabilistic rank and matrix rigidity J Alman, R Williams Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 68 | 2017 |
| How to capture higher-order correlations? generalizing matrix softmax attention to kronecker computation J Alman, Z Song arXiv preprint arXiv:2310.04064, 2023 | 66 | 2023 |
| Limits on all known (and some unknown) approaches to matrix multiplication J Alman, VV Williams SIAM Journal on Computing 52 (6), FOCS18-285-FOCS18-315, 2021 | 66 | 2021 |
| Limits on the universal method for matrix multiplication J Alman arXiv preprint arXiv:1812.08731, 2018 | 59 | 2018 |
| The fine-grained complexity of gradient computation for training large language models J Alman, Z Song Advances in Neural Information Processing Systems 37, 61419-61454, 2024 | 58 | 2024 |
| Efficient construction of rigid matrices using an NP oracle J Alman, L Chen SIAM Journal on Computing 54 (4), FOCS19-102-FOCS19-134, 2025 | 49 | 2025 |
| 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 | 48 | 2020 |
| Further limitations of the known approaches for matrix multiplication J Alman, VV Williams arXiv preprint arXiv:1712.07246, 2017 | 48 | 2017 |
| Optimal-degree polynomial approximations for exponentials and gaussian kernel density estimation A Aggarwal, J Alman arXiv preprint arXiv:2205.06249, 2022 | 43 | 2022 |
| Bypass exponential time preprocessing: Fast neural network training via weight-data correlation preprocessing J Alman, Z Song, R Zhang, D Zhuo Advances in Neural Information Processing Systems 36, 48110-48137, 2023 | 42 | 2023 |
| Dynamic Parameterized Problems and Algorithms M Mnich, V Vassilevska Williams, J Alman ACM Transactions on Algorithms (TALG), 2020 | 38* | 2020 |
| An illuminating algorithm for the light bulb problem J Alman arXiv preprint arXiv:1810.06740, 2018 | 35 | 2018 |
| Fast rope attention: Combining the polynomial method and fast fourier transform J Alman, Z Song | 28 | 2024 |
| Laurent Phenomenon Sequences J Alman, C Cuenca, J Huang Journal of Algebraic Combinatorics 43 (3), 589–633, 2015 | 23 | 2015 |
| Circular planar electrical networks: Posets and positivity J Alman, C Lian, B Tran Journal of Combinatorial Theory, Series A 132, 58-101, 2015 | 22* | 2015 |
