Avishay Tal
Scholar

Avishay Tal

Google Scholar ID: 4pytJD8AAAAJ
UC Berkeley
Theoretical Computer ScienceComputational ComplexityPseudorandomnessCircuit Lower BoundsAnalysis of Boolean Functions
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
1,767
 
H-index
24
 
i10-index
35
 
Publications
20
 
Co-authors
53
list available
Contact
No contact links provided.
Publications
1 items
Improved Lower Bounds for QAC0
2025
Cited
0
Resume (English only)
Co-authors
53 total
Co-author 1
Co-author 1
Pooya Hatami
Pooya Hatami
The Ohio State University
Co-author 3
Co-author 3
Amir Shpilka
Amir Shpilka
Department of Computer Science, Tel Aviv University
Omer Reingold
Omer Reingold
Stanford University
Shalev Ben-David
Shalev Ben-David
Associate Professor, University of Waterloo
Sumegha Garg
Sumegha Garg
Assistant Professor, Rutgers University
Makrand Sinha
Makrand Sinha
Assistant Professor, Computer Science, University of Illinois Urbana-Champaign