Scholar
Avishay Tal
Google Scholar ID: 4pytJD8AAAAJ
UC Berkeley
Theoretical Computer Science
Computational Complexity
Pseudorandomness
Circuit Lower Bounds
Analysis of Boolean Functions
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
1,767
H-index
24
i10-index
35
Publications
20
Co-authors
53
list available
Publications
7 items
Exponential Correlation Bounds for Polynomials
2026
Cited
0
$\mathsf{BQP} \subseteq \mathsf{IP}$ Does Not Relativize
2026
Cited
0
Unconditional Certified Randomness without Structure
2026
Cited
0
Certified Randomness without Structure Against Shallow-Query Adversaries
2026
Cited
0
Quantum Advantage in Tolerant Junta Testing
2026
Cited
0
A Relativizing MIP for BQP
2026
Cited
0
Improved Lower Bounds for QAC0
2025
Cited
0
Co-authors
14 total
Ran Raz
Princeton University
Pooya Hatami
The Ohio State University
Amir Shpilka
Department of Computer Science, Tel Aviv University
Omer Reingold
Stanford University
Shalev Ben-David
Associate Professor, University of Waterloo
Sumegha Garg
Assistant Professor, Rutgers University
Makrand Sinha
Assistant Professor, Computer Science, University of Illinois Urbana-Champaign
Eshan Chattopadhyay
Associate Professor at Cornell University
