![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Josh Alman
aka: Joshua Alman
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 69 matches
- 2024
- Josh Alman, Yunfeng Guan:
Finer-Grained Hardness of Kernel Density Estimation. CCC 2024: 35:1-35:21 - Josh Alman, Ethan Turok, Hantao Yu, Hengzhi Zhang:
Tensor Ranks and the Fine-Grained Complexity of Dynamic Programming. ITCS 2024: 4:1-4:23 - Josh Alman, Zhao Song:
The Fine-Grained Complexity of Gradient Computation for Training Large Language Models. CoRR abs/2402.04497 (2024) - Josh Alman, Ran Duan, Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou:
More Asymmetry Yields Faster Matrix Multiplication. CoRR abs/2404.16349 (2024) - 2023
- Josh Alman, Virginia Vassilevska Williams:
Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication. SIAM J. Comput. 52(6): S18-285 (2023) - Yuqi Huai
, Sumaya Almanee
, Yuntianyi Chen
, Xiafa Wu
, Qi Alfred Chen
, Joshua Garcia
:
scenoRITA: Generating Diverse, Fully Mutable, Test Scenarios for Autonomous Vehicle Planning. IEEE Trans. Software Eng. 49(10): 4656-4676 (2023) - Josh Alman, Jaroslaw Blasiok
:
Matrix Multiplication and Number on the Forehead Communication. CCC 2023: 16:1-16:23 - Josh Alman, Hengjie Zhang:
Generalizations of Matrix Multiplication can solve the Light Bulb Problem. FOCS 2023: 1471-1495 - Yuqi Huai
, Yuntianyi Chen
, Sumaya Almanee
, Tuan Ngo
, Xiang Liao
, Ziwen Wan
, Qi Alfred Chen
, Joshua Garcia
:
Doppelgänger Test Generation for Revealing Bugs in Autonomous Driving Software. ICSE 2023: 2591-2603 - Josh Alman, Zhao Song:
Fast Attention Requires Bounded Entries. NeurIPS 2023 - 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 - Josh Alman, Yunfeng Guan, Ashwin Padaki:
Smaller Low-Depth Circuits for Kronecker Powers. SODA 2023: 4159-4187 - Josh Alman:
Faster Walsh-Hadamard Transform and Matrix Multiplication over Finite Fields using Lookup Tables. SOSA 2023: 137-144 - Josh Alman, Kevin Rao:
Faster Walsh-Hadamard and Discrete Fourier Transforms from Matrix Non-rigidity. STOC 2023: 455-462 - Josh Alman, Jaroslaw Blasiok
:
Matrix Multiplication and Number On the Forehead Communication. CoRR abs/2302.11476 (2023) - Josh Alman, Zhao Song:
Fast Attention Requires Bounded Entries. CoRR abs/2302.13214 (2023) - Josh Alman, Ethan Turok, Hantao Yu, Hengzhi Zhang:
Tensors Ranks and the Fine-Grained Complexity of Dynamic Programming. CoRR abs/2309.04683 (2023) - Josh Alman, Zhao Song:
How to Capture Higher-order Correlations? Generalizing Matrix Softmax Attention to Kronecker Computation. CoRR abs/2310.04064 (2023) - Josh Alman, Hengjie Zhang:
Generalizations of Matrix Multiplication can solve the Light Bulb Problem. CoRR abs/2311.01630 (2023) - 2022
- Amol Aggarwal, Josh Alman:
Optimal-Degree Polynomial Approximations for Exponentials and Gaussian Kernel Density Estimation. CCC 2022: 22:1-22:23 - Josh Alman, Dean Hirsch:
Parameterized Sensitivity Oracles and Dynamic Algorithms Using Exterior Algebras. ICALP 2022: 9:1-9:19 - Josh Alman, Dean Hirsch:
Parameterized Sensitivity Oracles and Dynamic Algorithms using Exterior Algebras. CoRR abs/2204.10819 (2022) - Amol Aggarwal, Josh Alman:
Optimal-Degree Polynomial Approximations for Exponentials and Gaussian Kernel Density Estimation. CoRR abs/2205.06249 (2022) - Josh Alman:
Faster Walsh-Hadamard Transform and Matrix Multiplication over Finite Fields using Lookup Tables. CoRR abs/2211.04643 (2022) - Josh Alman, Yunfeng Guan, Ashwin Padaki:
Smaller Low-Depth Circuits for Kronecker Powers. CoRR abs/2211.05217 (2022) - Josh Alman, Kevin Rao:
Faster Walsh-Hadamard and Discrete Fourier Transforms From Matrix Non-Rigidity. CoRR abs/2211.06459 (2022) - 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
- Josh Alman:
Limits on the Universal Method for Matrix Multiplication. Theory Comput. 17: 1-30 (2021) - Sumaya Almanee, Arda Ünal, Mathias Payer, Joshua Garcia:
Too Quiet in the Library: An Empirical Study of Security Updates in Android Apps' Native Code. ICSE 2021: 1347-1359 - Sumaya Almanee, Arda Ünal, Mathias Payer, Joshua Garcia:
Too Quiet in the Library: An Empirical Study of Security Updates in Android Apps' Native Code. ICSE (Companion Volume) 2021: 170
skipping 39 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-07-27 02:20 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint