Josh Alman
Orcid: 0009-0002-2204-1359
According to our database1,
Josh Alman
authored at least 37 papers
between 2015 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
8
9
10
4
2
1
1
1
1
1
2
3
7
2
1
4
2
1
2
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025
2024
CoRR, 2024
The Fine-Grained Complexity of Gradient Computation for Training Large Language Models.
CoRR, 2024
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024
How to Capture Higher-order Correlations? Generalizing Matrix Softmax Attention to Kronecker Computation.
Proceedings of the Twelfth International Conference on Learning Representations, 2024
Proceedings of the 39th Computational Complexity Conference, 2024
2023
SIAM J. Comput., December, 2023
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Faster Walsh-Hadamard Transform and Matrix Multiplication over Finite Fields using Lookup Tables.
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Bypass Exponential Time Preprocessing: Fast Neural Network Training via Weight-Data Correlation Preprocessing.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
Proceedings of the 38th Computational Complexity Conference, 2023
2022
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
Optimal-Degree Polynomial Approximations for Exponentials and Gaussian Kernel Density Estimation.
Proceedings of the 37th Computational Complexity Conference, 2022
2021
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
2020
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High Dimensions.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
2019
IACR Cryptol. ePrint Arch., 2019
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
2018
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018
2017
Electron. Colloquium Comput. Complex., 2017
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017
2016
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
2015
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015