default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosh Alman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Josh Alman
, Virginia Vassilevska Williams:
A Refined Laser Method and Faster Matrix Multiplication. TheoretiCS 3 (2024)- [c30]Josh Alman, Yunfeng Guan:
Finer-Grained Hardness of Kernel Density Estimation. CCC 2024: 35:1-35:21 - [c29]Josh Alman, Zhao Song:
How to Capture Higher-order Correlations? Generalizing Matrix Softmax Attention to Kronecker Computation. ICLR 2024 - [c28]Josh Alman, Ethan Turok, Hantao Yu, Hengzhi Zhang:
Tensor Ranks and the Fine-Grained Complexity of Dynamic Programming. ITCS 2024: 4:1-4:23 - [i32]Josh Alman, Zhao Song:
The Fine-Grained Complexity of Gradient Computation for Training Large Language Models. CoRR abs/2402.04497 (2024) - [i31]Josh Alman, Ran Duan, Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou:
More Asymmetry Yields Faster Matrix Multiplication. CoRR abs/2404.16349 (2024) - [i30]Josh Alman, Yunfeng Guan:
Finer-Grained Hardness of Kernel Density Estimation. CoRR abs/2407.02372 (2024) - [i29]Josh Alman, Hantao Yu:
Fundamental Limitations on Subquadratic Alternatives to Transformers. CoRR abs/2410.04271 (2024) - [i28]Josh Alman, Hantao Yu:
Improving the Leading Constant of Matrix Multiplication. CoRR abs/2410.20538 (2024) - [i27]Josh Alman, Alexandr Andoni, Hengjie Zhang:
Faster Algorithms for Average-Case Orthogonal Vectors and Closest Pair Problems. CoRR abs/2410.22477 (2024) - 2023
- [j4]Josh Alman, Virginia Vassilevska Williams:
Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication. SIAM J. Comput. 52(6): S18-285 (2023) - [c27]Josh Alman, Jaroslaw Blasiok:
Matrix Multiplication and Number on the Forehead Communication. CCC 2023: 16:1-16:23 - [c26]Josh Alman, Hengjie Zhang:
Generalizations of Matrix Multiplication can solve the Light Bulb Problem. FOCS 2023: 1471-1495 - [c25]Josh Alman, Zhao Song:
Fast Attention Requires Bounded Entries. NeurIPS 2023 - [c24]Josh Alman, Jiehao Liang, Zhao Song, Ruizhe Zhang, Danyang Zhuo:
Bypass Exponential Time Preprocessing: Fast Neural Network Training via Weight-Data Correlation Preprocessing. NeurIPS 2023 - [c23]Josh Alman, Yunfeng Guan, Ashwin Padaki:
Smaller Low-Depth Circuits for Kronecker Powers. SODA 2023: 4159-4187 - [c22]Josh Alman:
Faster Walsh-Hadamard Transform and Matrix Multiplication over Finite Fields using Lookup Tables. SOSA 2023: 137-144 - [c21]Josh Alman, Kevin Rao:
Faster Walsh-Hadamard and Discrete Fourier Transforms from Matrix Non-rigidity. STOC 2023: 455-462 - [i26]Josh Alman, Jaroslaw Blasiok:
Matrix Multiplication and Number On the Forehead Communication. CoRR abs/2302.11476 (2023) - [i25]Josh Alman, Zhao Song:
Fast Attention Requires Bounded Entries. CoRR abs/2302.13214 (2023) - [i24]Josh Alman, Ethan Turok, Hantao Yu, Hengzhi Zhang:
Tensors Ranks and the Fine-Grained Complexity of Dynamic Programming. CoRR abs/2309.04683 (2023) - [i23]Josh Alman, Zhao Song:
How to Capture Higher-order Correlations? Generalizing Matrix Softmax Attention to Kronecker Computation. CoRR abs/2310.04064 (2023) - [i22]Josh Alman, Hengjie Zhang:
Generalizations of Matrix Multiplication can solve the Light Bulb Problem. CoRR abs/2311.01630 (2023) - 2022
- [c20]Amol Aggarwal, Josh Alman:
Optimal-Degree Polynomial Approximations for Exponentials and Gaussian Kernel Density Estimation. CCC 2022: 22:1-22:23 - [c19]Josh Alman, Dean Hirsch:
Parameterized Sensitivity Oracles and Dynamic Algorithms Using Exterior Algebras. ICALP 2022: 9:1-9:19 - [i21]Josh Alman, Dean Hirsch:
Parameterized Sensitivity Oracles and Dynamic Algorithms using Exterior Algebras. CoRR abs/2204.10819 (2022) - [i20]Amol Aggarwal, Josh Alman:
Optimal-Degree Polynomial Approximations for Exponentials and Gaussian Kernel Density Estimation. CoRR abs/2205.06249 (2022) - [i19]Josh Alman:
Faster Walsh-Hadamard Transform and Matrix Multiplication over Finite Fields using Lookup Tables. CoRR abs/2211.04643 (2022) - [i18]Josh Alman, Yunfeng Guan, Ashwin Padaki:
Smaller Low-Depth Circuits for Kronecker Powers. CoRR abs/2211.05217 (2022) - [i17]Josh Alman, Kevin Rao:
Faster Walsh-Hadamard and Discrete Fourier Transforms From Matrix Non-Rigidity. CoRR abs/2211.06459 (2022) - [i16]Josh Alman, Jiehao Liang, Zhao Song, Ruizhe Zhang, Danyang Zhuo:
Bypass Exponential Time Preprocessing: Fast Neural Network Training via Weight-Data Correlation Preprocessing. CoRR abs/2211.14227 (2022) - 2021
- [j3]Josh Alman:
Limits on the Universal Method for Matrix Multiplication. Adv. Math. Commun. 17: 1-30 (2021) - [c18]Josh Alman, Virginia Vassilevska Williams:
A Refined Laser Method and Faster Matrix Multiplication. SODA 2021: 522-539 - [c17]Josh Alman:
Kronecker products, low-depth circuits, and matrix rigidity. STOC 2021: 772-785 - [i15]Josh Alman:
Kronecker Products, Low-Depth Circuits, and Matrix Rigidity. CoRR abs/2102.11992 (2021) - 2020
- [j2]Josh Alman, Matthias Mnich, Virginia Vassilevska Williams:
Dynamic Parameterized Problems and Algorithms. ACM Trans. Algorithms 16(4): 45:1-45:46 (2020) - [c16]Josh Alman, Timothy Chu, Aaron Schild, Zhao Song:
Algorithms and Hardness for Linear Algebra on Geometric Graphs. FOCS 2020: 541-552 - [c15]Josh Alman, Virginia Vassilevska Williams:
OV Graphs Are (Probably) Hard Instances. ITCS 2020: 83:1-83:18 - [c14]Josh Alman, Timothy M. Chan, R. Ryan Williams:
Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High Dimensions. SODA 2020: 637-649 - [c13]Josh Alman, Huacheng Yu:
Faster Update Time for Turnstile Streaming Algorithms. SODA 2020: 1803-1813 - [i14]Josh Alman, Virginia Vassilevska Williams:
A Refined Laser Method and Faster Matrix Multiplication. CoRR abs/2010.05846 (2020) - [i13]Josh Alman, Timothy Chu, Aaron Schild, Zhao Song:
Algorithms and Hardness for Linear Algebra on Geometric Graphs. CoRR abs/2011.02466 (2020)
2010 – 2019
- 2019
- [c12]Josh Alman:
Limits on the Universal Method for Matrix Multiplication. CCC 2019: 12:1-12:24 - [c11]Josh Alman, Lijie Chen:
Efficient Construction of Rigid Matrices Using an NP Oracle. FOCS 2019: 1034-1055 - [c10]Josh Alman:
An Illuminating Algorithm for the Light Bulb Problem. SOSA 2019: 2:1-2:11 - [c9]Josh Alman, Robin Hui:
Predicate Encryption from Bilinear Maps and One-Sided Probabilistic Rank. TCC (1) 2019: 151-173 - [i12]Josh Alman, Huacheng Yu:
Faster Update Time for Turnstile Streaming Algorithms. CoRR abs/1911.01351 (2019) - [i11]Josh Alman, Robin Hui:
Predicate Encryption from Bilinear Maps and One-Sided Probabilistic Rank. IACR Cryptol. ePrint Arch. 2019: 1045 (2019) - 2018
- [c8]Josh Alman, Virginia Vassilevska Williams:
Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication. FOCS 2018: 580-591 - [c7]Josh Alman, Virginia Vassilevska Williams:
Further Limitations of the Known Approaches for Matrix Multiplication. ITCS 2018: 25:1-25:15 - [c6]Josh Alman, Joshua R. Wang, Huacheng Yu:
Cell-probe lower bounds from online communication complexity. STOC 2018: 1003-1012 - [i10]Josh Alman:
An Illuminating Algorithm for the Light Bulb Problem. CoRR abs/1810.06740 (2018) - [i9]Josh Alman, Virginia Vassilevska Williams:
Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication. CoRR abs/1810.08671 (2018) - [i8]Josh Alman:
Limits on the Universal Method for Matrix Multiplication. CoRR abs/1812.08731 (2018) - 2017
- [c5]Josh Alman, Dylan M. McKay:
Theoretical Foundations of Team Matchmaking. AAMAS 2017: 1073-1081 - [c4]Josh Alman, Matthias Mnich, Virginia Vassilevska Williams:
Dynamic Parameterized Problems and Algorithms. ICALP 2017: 41:1-41:16 - [c3]Josh Alman, R. Ryan Williams:
Probabilistic rank and matrix rigidity. STOC 2017: 641-652 - [i7]Josh Alman, Joshua R. Wang, Huacheng Yu:
Cell-Probe Lower Bounds from Online Communication Complexity. CoRR abs/1704.06185 (2017) - [i6]Josh Alman, Matthias Mnich, Virginia Vassilevska Williams:
Dynamic Parameterized Problems and Algorithms. CoRR abs/1707.00362 (2017) - [i5]Josh Alman, Virginia Vassilevska Williams:
Further limitations of the known approaches for matrix multiplication. CoRR abs/1712.07246 (2017) - [i4]Josh Alman, Joshua R. Wang, Huacheng Yu:
Cell-Probe Lower Bounds from Online Communication Complexity. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c2]Josh Alman, Timothy M. Chan, R. Ryan Williams:
Polynomial Representations of Threshold Functions and Algorithmic Applications. FOCS 2016: 467-476 - [i3]Josh Alman, Timothy M. Chan, Ryan Williams:
Polynomial Representations of Threshold Functions and Algorithmic Applications. CoRR abs/1608.04355 (2016) - [i2]Josh Alman, Ryan Williams:
Probabilistic Rank and Matrix Rigidity. CoRR abs/1611.05558 (2016) - 2015
- [j1]Joshua Alman, Carl Lian, Brandon Tran:
Circular planar electrical networks: Posets and positivity. J. Comb. Theory A 132: 58-101 (2015) - [c1]Josh Alman, Ryan Williams:
Probabilistic Polynomials and Hamming Nearest Neighbors. FOCS 2015: 136-150 - [i1]Josh Alman, Ryan Williams:
Probabilistic Polynomials and Hamming Nearest Neighbors. CoRR abs/1507.05106 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-12 22:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
