Scholar
Josh Alman
Google Scholar ID: yyDMlesAAAAJ
Columbia University
Theoretical Computer Science
Algorithms
Complexity
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
1,677
H-index
18
i10-index
22
Publications
20
Co-authors
0
Contact
No contact links provided.
Publications
14 items
Superlogarithmic-Rank Matrix Rigidity for the Walsh-Hadamard Transform
2026
Cited
0
Asymptotic Rank Speedup Theorems, Revisited
2026
Cited
0
The edge of the asymptotic spectrum of tensors
2026
Cited
0
Learning Functions of Halfspaces
2026
Cited
0
Poly-attention: a general scheme for higher-order self-attention
2026
Cited
1
Every Bit Counts: A Theoretical Study of Precision-Expressivity Tradeoffs in Quantized Transformers
2026
Cited
0
Kronecker Powers, Orthogonal Vectors, and the Asymptotic Spectrum
2025
Cited
0
Faster exact learning of k-term DNFs with membership and equivalence queries
2025
Cited
0
Load more
Resume (English only)
Co-authors
0 total
Co-authors: 0 (list not available)
