Josh Alman
Josh Alman
Harvard, MIT
Dirección de correo verificada de mit.edu - Página principal
TítuloCitado porAño
Probabilistic polynomials and hamming nearest neighbors
J Alman, R Williams
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 136-150, 2015
742015
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
612016
Laurent Phenomenon Sequences
J Alman, C Cuenca, J Huang
Journal of Algebraic Combinatorics 43 (3), 589–633, 2015
202015
Probabilistic rank and matrix rigidity
J Alman, R Williams
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
192017
Limits on all known (and some unknown) approaches to matrix multiplication
J Alman, VV Williams
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
162018
Further limitations of the known approaches for matrix multiplication
J Alman, VV Williams
arXiv preprint arXiv:1712.07246, 2017
162017
Circular planar electrical networks: Posets and positivity
J Alman, C Lian, B Tran
Journal of Combinatorial Theory, Series A 132, 58-101, 2015
13*2015
An illuminating algorithm for the light bulb problem
J Alman
arXiv preprint arXiv:1810.06740, 2018
82018
Dynamic parameterized problems and algorithms
J Alman, M Mnich, VV Williams
arXiv preprint arXiv:1707.00362, 2017
72017
Limits on the universal method for matrix multiplication
J Alman
arXiv preprint arXiv:1812.08731, 2018
52018
Theoretical foundations of team matchmaking
J Alman, D McKay
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent …, 2017
52017
Efficient construction of rigid matrices using an NP oracle
J Alman, L Chen
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
32019
OV Graphs Are (Probably) Hard Instances
J Alman, V Vassilevska Williams
11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020
12020
Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High Dimensions
J Alman, TM Chan, R Williams
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
12020
Cell-probe lower bounds from online communication complexity
J Alman, JR Wang, H Yu
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
12018
Faster Update Time for Turnstile Streaming Algorithms
J Alman, H Yu
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
2020
Predicate Encryption from Bilinear Maps and One-Sided Probabilistic Rank
J Alman, R Hui
Theory of Cryptography Conference, 151-173, 2019
2019
Linear Algebraic Techniques in Algorithms and Complexity
J Alman
Massachusetts Institute of Technology, 2019
2019
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–18