Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Josh Alman
@inproceedings{DBLP:conf/innovations/AlmanTYZ24,
author = {Josh Alman and
Ethan Turok and
Hantao Yu and
Hengzhi Zhang},
editor = {Venkatesan Guruswami},
title = {Tensor Ranks and the Fine-Grained Complexity of Dynamic Programming},
booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {287},
pages = {4:1--4:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.4},
doi = {10.4230/LIPICS.ITCS.2024.4},
timestamp = {Wed, 24 Jan 2024 15:25:09 +0100},
biburl = {https://dblp.org/rec/conf/innovations/AlmanTYZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-04497,
author = {Josh Alman and
Zhao Song},
title = {The Fine-Grained Complexity of Gradient Computation for Training Large
Language Models},
journal = {CoRR},
volume = {abs/2402.04497},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.04497},
doi = {10.48550/ARXIV.2402.04497},
eprinttype = {arXiv},
eprint = {2402.04497},
timestamp = {Wed, 14 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-04497.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlmanW23,
author = {Josh Alman and
Virginia Vassilevska Williams},
title = {Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication},
journal = {{SIAM} J. Comput.},
volume = {52},
number = {6},
pages = {S18--285},
year = {2023},
url = {https://doi.org/10.1137/19m124695x},
doi = {10.1137/19M124695X},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/AlmanW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AlmanB23,
author = {Josh Alman and
Jaroslaw Blasiok},
editor = {Amnon Ta{-}Shma},
title = {Matrix Multiplication and Number on the Forehead Communication},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {16:1--16:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.16},
doi = {10.4230/LIPICS.CCC.2023.16},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AlmanB23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlmanZ23,
author = {Josh Alman and
Hengjie Zhang},
title = {Generalizations of Matrix Multiplication can solve the Light Bulb
Problem},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1471--1495},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00090},
doi = {10.1109/FOCS57990.2023.00090},
timestamp = {Tue, 02 Jan 2024 14:56:14 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlmanZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/Alman023,
author = {Josh Alman and
Zhao Song},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {Fast Attention Requires Bounded Entries},
booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference
on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans,
LA, USA, December 10 - 16, 2023},
year = {2023},
url = {http://papers.nips.cc/paper\_files/paper/2023/hash/c72861451d6fa9dfa64831102b9bb71a-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/Alman023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/AlmanL00Z23,
author = {Josh Alman and
Jiehao Liang and
Zhao Song and
Ruizhe Zhang and
Danyang Zhuo},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {Bypass Exponential Time Preprocessing: Fast Neural Network Training
via Weight-Data Correlation Preprocessing},
booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference
on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans,
LA, USA, December 10 - 16, 2023},
year = {2023},
url = {http://papers.nips.cc/paper\_files/paper/2023/hash/9690d4746230cfea3d067fca695ba648-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/AlmanL00Z23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlmanGP23,
author = {Josh Alman and
Yunfeng Guan and
Ashwin Padaki},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Smaller Low-Depth Circuits for Kronecker Powers},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {4159--4187},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch160},
doi = {10.1137/1.9781611977554.CH160},
timestamp = {Fri, 17 Feb 2023 09:28:57 +0100},
biburl = {https://dblp.org/rec/conf/soda/AlmanGP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/Alman23,
author = {Josh Alman},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Faster Walsh-Hadamard Transform and Matrix Multiplication over Finite
Fields using Lookup Tables},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {137--144},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch13},
doi = {10.1137/1.9781611977585.CH13},
timestamp = {Mon, 20 Mar 2023 16:52:56 +0100},
biburl = {https://dblp.org/rec/conf/sosa/Alman23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlmanR23,
author = {Josh Alman and
Kevin Rao},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Faster Walsh-Hadamard and Discrete Fourier Transforms from Matrix
Non-rigidity},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {455--462},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585188},
doi = {10.1145/3564246.3585188},
timestamp = {Mon, 22 May 2023 13:01:48 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AlmanR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-11476,
author = {Josh Alman and
Jaroslaw Blasiok},
title = {Matrix Multiplication and Number On the Forehead Communication},
journal = {CoRR},
volume = {abs/2302.11476},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.11476},
doi = {10.48550/ARXIV.2302.11476},
eprinttype = {arXiv},
eprint = {2302.11476},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-11476.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-13214,
author = {Josh Alman and
Zhao Song},
title = {Fast Attention Requires Bounded Entries},
journal = {CoRR},
volume = {abs/2302.13214},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.13214},
doi = {10.48550/ARXIV.2302.13214},
eprinttype = {arXiv},
eprint = {2302.13214},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-13214.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-04683,
author = {Josh Alman and
Ethan Turok and
Hantao Yu and
Hengzhi Zhang},
title = {Tensors Ranks and the Fine-Grained Complexity of Dynamic Programming},
journal = {CoRR},
volume = {abs/2309.04683},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.04683},
doi = {10.48550/ARXIV.2309.04683},
eprinttype = {arXiv},
eprint = {2309.04683},
timestamp = {Fri, 15 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-04683.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-04064,
author = {Josh Alman and
Zhao Song},
title = {How to Capture Higher-order Correlations? Generalizing Matrix Softmax
Attention to Kronecker Computation},
journal = {CoRR},
volume = {abs/2310.04064},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.04064},
doi = {10.48550/ARXIV.2310.04064},
eprinttype = {arXiv},
eprint = {2310.04064},
timestamp = {Fri, 20 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-04064.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-01630,
author = {Josh Alman and
Hengjie Zhang},
title = {Generalizations of Matrix Multiplication can solve the Light Bulb
Problem},
journal = {CoRR},
volume = {abs/2311.01630},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.01630},
doi = {10.48550/ARXIV.2311.01630},
eprinttype = {arXiv},
eprint = {2311.01630},
timestamp = {Tue, 07 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-01630.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AggarwalA22,
author = {Amol Aggarwal and
Josh Alman},
editor = {Shachar Lovett},
title = {Optimal-Degree Polynomial Approximations for Exponentials and Gaussian
Kernel Density Estimation},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {22:1--22:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.22},
doi = {10.4230/LIPICS.CCC.2022.22},
timestamp = {Tue, 12 Jul 2022 17:25:23 +0200},
biburl = {https://dblp.org/rec/conf/coco/AggarwalA22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AlmanH22,
author = {Josh Alman and
Dean Hirsch},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {Parameterized Sensitivity Oracles and Dynamic Algorithms Using Exterior
Algebras},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {9:1--9:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.9},
doi = {10.4230/LIPICS.ICALP.2022.9},
timestamp = {Tue, 28 Jun 2022 15:52:51 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AlmanH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-10819,
author = {Josh Alman and
Dean Hirsch},
title = {Parameterized Sensitivity Oracles and Dynamic Algorithms using Exterior
Algebras},
journal = {CoRR},
volume = {abs/2204.10819},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.10819},
doi = {10.48550/ARXIV.2204.10819},
eprinttype = {arXiv},
eprint = {2204.10819},
timestamp = {Mon, 25 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-10819.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-06249,
author = {Amol Aggarwal and
Josh Alman},
title = {Optimal-Degree Polynomial Approximations for Exponentials and Gaussian
Kernel Density Estimation},
journal = {CoRR},
volume = {abs/2205.06249},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.06249},
doi = {10.48550/ARXIV.2205.06249},
eprinttype = {arXiv},
eprint = {2205.06249},
timestamp = {Tue, 17 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-06249.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-04643,
author = {Josh Alman},
title = {Faster Walsh-Hadamard Transform and Matrix Multiplication over Finite
Fields using Lookup Tables},
journal = {CoRR},
volume = {abs/2211.04643},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.04643},
doi = {10.48550/ARXIV.2211.04643},
eprinttype = {arXiv},
eprint = {2211.04643},
timestamp = {Tue, 15 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-04643.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-05217,
author = {Josh Alman and
Yunfeng Guan and
Ashwin Padaki},
title = {Smaller Low-Depth Circuits for Kronecker Powers},
journal = {CoRR},
volume = {abs/2211.05217},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.05217},
doi = {10.48550/ARXIV.2211.05217},
eprinttype = {arXiv},
eprint = {2211.05217},
timestamp = {Tue, 15 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-05217.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-06459,
author = {Josh Alman and
Kevin Rao},
title = {Faster Walsh-Hadamard and Discrete Fourier Transforms From Matrix
Non-Rigidity},
journal = {CoRR},
volume = {abs/2211.06459},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.06459},
doi = {10.48550/ARXIV.2211.06459},
eprinttype = {arXiv},
eprint = {2211.06459},
timestamp = {Tue, 15 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-06459.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-14227,
author = {Josh Alman and
Jiehao Liang and
Zhao Song and
Ruizhe Zhang and
Danyang Zhuo},
title = {Bypass Exponential Time Preprocessing: Fast Neural Network Training
via Weight-Data Correlation Preprocessing},
journal = {CoRR},
volume = {abs/2211.14227},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.14227},
doi = {10.48550/ARXIV.2211.14227},
eprinttype = {arXiv},
eprint = {2211.14227},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-14227.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Alman21,
author = {Josh Alman},
title = {Limits on the Universal Method for Matrix Multiplication},
journal = {Theory Comput.},
volume = {17},
pages = {1--30},
year = {2021},
url = {https://theoryofcomputing.org/articles/v017a001/},
timestamp = {Tue, 07 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toc/Alman21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlmanW21,
author = {Josh Alman and
Virginia Vassilevska Williams},
editor = {D{\'{a}}niel Marx},
title = {A Refined Laser Method and Faster Matrix Multiplication},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {522--539},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.32},
doi = {10.1137/1.9781611976465.32},
timestamp = {Thu, 15 Jul 2021 13:48:55 +0200},
biburl = {https://dblp.org/rec/conf/soda/AlmanW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Alman21,
author = {Josh Alman},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Kronecker products, low-depth circuits, and matrix rigidity},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {772--785},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451008},
doi = {10.1145/3406325.3451008},
timestamp = {Tue, 22 Jun 2021 19:47:11 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Alman21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-11992,
author = {Josh Alman},
title = {Kronecker Products, Low-Depth Circuits, and Matrix Rigidity},
journal = {CoRR},
volume = {abs/2102.11992},
year = {2021},
url = {https://arxiv.org/abs/2102.11992},
eprinttype = {arXiv},
eprint = {2102.11992},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-11992.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AlmanMW20,
author = {Josh Alman and
Matthias Mnich and
Virginia Vassilevska Williams},
title = {Dynamic Parameterized Problems and Algorithms},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {4},
pages = {45:1--45:46},
year = {2020},
url = {https://doi.org/10.1145/3395037},
doi = {10.1145/3395037},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/AlmanMW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlmanCS020,
author = {Josh Alman and
Timothy Chu and
Aaron Schild and
Zhao Song},
editor = {Sandy Irani},
title = {Algorithms and Hardness for Linear Algebra on Geometric Graphs},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {541--552},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00057},
doi = {10.1109/FOCS46700.2020.00057},
timestamp = {Wed, 15 Dec 2021 10:49:16 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlmanCS020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/AlmanW20,
author = {Josh Alman and
Virginia Vassilevska Williams},
editor = {Thomas Vidick},
title = {{OV} Graphs Are (Probably) Hard Instances},
booktitle = {11th Innovations in Theoretical Computer Science Conference, {ITCS}
2020, January 12-14, 2020, Seattle, Washington, {USA}},
series = {LIPIcs},
volume = {151},
pages = {83:1--83:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2020.83},
doi = {10.4230/LIPICS.ITCS.2020.83},
timestamp = {Mon, 06 Jan 2020 16:50:09 +0100},
biburl = {https://dblp.org/rec/conf/innovations/AlmanW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlmanCW20,
author = {Josh Alman and
Timothy M. Chan and
R. Ryan Williams},
editor = {Shuchi Chawla},
title = {Faster Deterministic and Las Vegas Algorithms for Offline Approximate
Nearest Neighbors in High Dimensions},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {637--649},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.39},
doi = {10.1137/1.9781611975994.39},
timestamp = {Thu, 15 Jul 2021 13:48:53 +0200},
biburl = {https://dblp.org/rec/conf/soda/AlmanCW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlmanY20,
author = {Josh Alman and
Huacheng Yu},
editor = {Shuchi Chawla},
title = {Faster Update Time for Turnstile Streaming Algorithms},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {1803--1813},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.110},
doi = {10.1137/1.9781611975994.110},
timestamp = {Thu, 15 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/AlmanY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-05846,
author = {Josh Alman and
Virginia Vassilevska Williams},
title = {A Refined Laser Method and Faster Matrix Multiplication},
journal = {CoRR},
volume = {abs/2010.05846},
year = {2020},
url = {https://arxiv.org/abs/2010.05846},
eprinttype = {arXiv},
eprint = {2010.05846},
timestamp = {Tue, 20 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-05846.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-02466,
author = {Josh Alman and
Timothy Chu and
Aaron Schild and
Zhao Song},
title = {Algorithms and Hardness for Linear Algebra on Geometric Graphs},
journal = {CoRR},
volume = {abs/2011.02466},
year = {2020},
url = {https://arxiv.org/abs/2011.02466},
eprinttype = {arXiv},
eprint = {2011.02466},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-02466.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Alman19,
author = {Josh Alman},
editor = {Amir Shpilka},
title = {Limits on the Universal Method for Matrix Multiplication},
booktitle = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
2019, New Brunswick, NJ, {USA}},
series = {LIPIcs},
volume = {137},
pages = {12:1--12:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.CCC.2019.12},
doi = {10.4230/LIPICS.CCC.2019.12},
timestamp = {Thu, 02 Feb 2023 13:27:04 +0100},
biburl = {https://dblp.org/rec/conf/coco/Alman19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlmanC19,
author = {Josh Alman and
Lijie Chen},
editor = {David Zuckerman},
title = {Efficient Construction of Rigid Matrices Using an {NP} Oracle},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1034--1055},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00067},
doi = {10.1109/FOCS.2019.00067},
timestamp = {Fri, 05 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlmanC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Alman19,
author = {Josh Alman},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {An Illuminating Algorithm for the Light Bulb Problem},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {2:1--2:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.2},
doi = {10.4230/OASICS.SOSA.2019.2},
timestamp = {Tue, 15 Feb 2022 09:40:03 +0100},
biburl = {https://dblp.org/rec/conf/soda/Alman19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/AlmanH19,
author = {Josh Alman and
Robin Hui},
editor = {Dennis Hofheinz and
Alon Rosen},
title = {Predicate Encryption from Bilinear Maps and One-Sided Probabilistic
Rank},
booktitle = {Theory of Cryptography - 17th International Conference, {TCC} 2019,
Nuremberg, Germany, December 1-5, 2019, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {11891},
pages = {151--173},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-36030-6\_7},
doi = {10.1007/978-3-030-36030-6\_7},
timestamp = {Mon, 25 Nov 2019 13:58:16 +0100},
biburl = {https://dblp.org/rec/conf/tcc/AlmanH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-01351,
author = {Josh Alman and
Huacheng Yu},
title = {Faster Update Time for Turnstile Streaming Algorithms},
journal = {CoRR},
volume = {abs/1911.01351},
year = {2019},
url = {http://arxiv.org/abs/1911.01351},
eprinttype = {arXiv},
eprint = {1911.01351},
timestamp = {Mon, 11 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-01351.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/AlmanH19,
author = {Josh Alman and
Robin Hui},
title = {Predicate Encryption from Bilinear Maps and One-Sided Probabilistic
Rank},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {1045},
year = {2019},
url = {https://eprint.iacr.org/2019/1045},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/AlmanH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlmanW18,
author = {Josh Alman and
Virginia Vassilevska Williams},
editor = {Mikkel Thorup},
title = {Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {580--591},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00061},
doi = {10.1109/FOCS.2018.00061},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlmanW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/AlmanW18,
author = {Josh Alman and
Virginia Vassilevska Williams},
editor = {Anna R. Karlin},
title = {Further Limitations of the Known Approaches for Matrix Multiplication},
booktitle = {9th Innovations in Theoretical Computer Science Conference, {ITCS}
2018, January 11-14, 2018, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {94},
pages = {25:1--25:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2018.25},
doi = {10.4230/LIPICS.ITCS.2018.25},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/innovations/AlmanW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlmanWY18,
author = {Josh Alman and
Joshua R. Wang and
Huacheng Yu},
editor = {Ilias Diakonikolas and
David Kempe and
Monika Henzinger},
title = {Cell-probe lower bounds from online communication complexity},
booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
pages = {1003--1012},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3188745.3188862},
doi = {10.1145/3188745.3188862},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AlmanWY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-06740,
author = {Josh Alman},
title = {An Illuminating Algorithm for the Light Bulb Problem},
journal = {CoRR},
volume = {abs/1810.06740},
year = {2018},
url = {http://arxiv.org/abs/1810.06740},
eprinttype = {arXiv},
eprint = {1810.06740},
timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-06740.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-08671,
author = {Josh Alman and
Virginia Vassilevska Williams},
title = {Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication},
journal = {CoRR},
volume = {abs/1810.08671},
year = {2018},
url = {http://arxiv.org/abs/1810.08671},
eprinttype = {arXiv},
eprint = {1810.08671},
timestamp = {Wed, 31 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-08671.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-08731,
author = {Josh Alman},
title = {Limits on the Universal Method for Matrix Multiplication},
journal = {CoRR},
volume = {abs/1812.08731},
year = {2018},
url = {http://arxiv.org/abs/1812.08731},
eprinttype = {arXiv},
eprint = {1812.08731},
timestamp = {Wed, 02 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1812-08731.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/AlmanM17,
author = {Josh Alman and
Dylan M. McKay},
editor = {Kate Larson and
Michael Winikoff and
Sanmay Das and
Edmund H. Durfee},
title = {Theoretical Foundations of Team Matchmaking},
booktitle = {Proceedings of the 16th Conference on Autonomous Agents and MultiAgent
Systems, {AAMAS} 2017, S{\~{a}}o Paulo, Brazil, May 8-12, 2017},
pages = {1073--1081},
publisher = {{ACM}},
year = {2017},
url = {http://dl.acm.org/citation.cfm?id=3091277},
timestamp = {Thu, 07 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/atal/AlmanM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AlmanMW17,
author = {Josh Alman and
Matthias Mnich and
Virginia Vassilevska Williams},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {Dynamic Parameterized Problems and Algorithms},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {41:1--41:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.41},
doi = {10.4230/LIPICS.ICALP.2017.41},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AlmanMW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlmanW17,
author = {Josh Alman and
R. Ryan Williams},
editor = {Hamed Hatami and
Pierre McKenzie and
Valerie King},
title = {Probabilistic rank and matrix rigidity},
booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
pages = {641--652},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3055399.3055484},
doi = {10.1145/3055399.3055484},
timestamp = {Sun, 02 Jun 2019 21:10:31 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AlmanW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlmanWY17,
author = {Josh Alman and
Joshua R. Wang and
Huacheng Yu},
title = {Cell-Probe Lower Bounds from Online Communication Complexity},
journal = {CoRR},
volume = {abs/1704.06185},
year = {2017},
url = {http://arxiv.org/abs/1704.06185},
eprinttype = {arXiv},
eprint = {1704.06185},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlmanWY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlmanMW17,
author = {Josh Alman and
Matthias Mnich and
Virginia Vassilevska Williams},
title = {Dynamic Parameterized Problems and Algorithms},
journal = {CoRR},
volume = {abs/1707.00362},
year = {2017},
url = {http://arxiv.org/abs/1707.00362},
eprinttype = {arXiv},
eprint = {1707.00362},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlmanMW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-07246,
author = {Josh Alman and
Virginia Vassilevska Williams},
title = {Further limitations of the known approaches for matrix multiplication},
journal = {CoRR},
volume = {abs/1712.07246},
year = {2017},
url = {http://arxiv.org/abs/1712.07246},
eprinttype = {arXiv},
eprint = {1712.07246},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-07246.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AlmanWY17,
author = {Josh Alman and
Joshua R. Wang and
Huacheng Yu},
title = {Cell-Probe Lower Bounds from Online Communication Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-066}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/066},
eprinttype = {ECCC},
eprint = {TR17-066},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AlmanWY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlmanCW16,
author = {Josh Alman and
Timothy M. Chan and
R. Ryan Williams},
editor = {Irit Dinur},
title = {Polynomial Representations of Threshold Functions and Algorithmic
Applications},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {467--476},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.57},
doi = {10.1109/FOCS.2016.57},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlmanCW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlmanCW16,
author = {Josh Alman and
Timothy M. Chan and
Ryan Williams},
title = {Polynomial Representations of Threshold Functions and Algorithmic
Applications},
journal = {CoRR},
volume = {abs/1608.04355},
year = {2016},
url = {http://arxiv.org/abs/1608.04355},
eprinttype = {arXiv},
eprint = {1608.04355},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlmanCW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Alman016,
author = {Josh Alman and
Ryan Williams},
title = {Probabilistic Rank and Matrix Rigidity},
journal = {CoRR},
volume = {abs/1611.05558},
year = {2016},
url = {http://arxiv.org/abs/1611.05558},
eprinttype = {arXiv},
eprint = {1611.05558},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Alman016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/AlmanLT15,
author = {Joshua Alman and
Carl Lian and
Brandon Tran},
title = {Circular planar electrical networks: Posets and positivity},
journal = {J. Comb. Theory, Ser. {A}},
volume = {132},
pages = {58--101},
year = {2015},
url = {https://doi.org/10.1016/j.jcta.2014.11.004},
doi = {10.1016/J.JCTA.2014.11.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/AlmanLT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlmanW15,
author = {Josh Alman and
Ryan Williams},
editor = {Venkatesan Guruswami},
title = {Probabilistic Polynomials and Hamming Nearest Neighbors},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {136--150},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.18},
doi = {10.1109/FOCS.2015.18},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlmanW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlmanW15,
author = {Josh Alman and
Ryan Williams},
title = {Probabilistic Polynomials and Hamming Nearest Neighbors},
journal = {CoRR},
volume = {abs/1507.05106},
year = {2015},
url = {http://arxiv.org/abs/1507.05106},
eprinttype = {arXiv},
eprint = {1507.05106},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlmanW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:58 CEST 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:
