Articles by Avi Wigderson: Theory of Computing: An Open Access Electronic Journal in Theoretical Computer Science

Articles by Avi Wigderson

Vol 21, Article 1 (pp 1-28)
On Linear-Algebraic Notions of Expansion
by Yinan Li, Youming Qiao, Avi Wigderson, Yuval Wigderson, and Chuanqi Zhang

Vol 17, Article 10 (pp 1-88) [CCC16 Spec Issue]
Proof Complexity Lower Bounds from Algebraic Circuit Complexity
by Michael A. Forbes, Amir Shpilka, Iddo Tzameret, and Avi Wigderson

Vol 13, Article 11 (pp 1-36)
Superquadratic Lower Bound for 3-Query Locally Correctable Codes over the Reals
by Zeev Dvir, Shubhangi Saraf, and Avi Wigderson

Vol 11, Article 14 (pp 357-393)
Non-Commutative Arithmetic Circuits with Division
by Pavel Hrubeš and Avi Wigderson

Vol 6, Article 12 (pp 291-308) [RESEARCH SURVEY]
Monotone Expanders: Constructions and Applications
by Zeev Dvir and Avi Wigderson

Vol 4, Article 7 (pp 137-168)
Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols
by Emanuele Viola and Avi Wigderson

Vol 4, Article 3 (pp 53-76)
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications
by Avi Wigderson and David Xiao

Vol 3, Article 11 (pp 211-219)
The Randomized Communication Complexity of Set Disjointness
by Johan Håstad and Avi Wigderson

Vol 2, Article 5 (pp 91-120)
Iterative Construction of Cayley Expander Graphs
by Eyal Rozenman, Aner Shalev, and Avi Wigderson