default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAvi Wigderson
Person information
- affiliation: Princeton, New Jersey, USA
- award (2023): Turing Award
- award (2021): Abel Prize
- award (2019): Knuth Prize
- award (2009): Gödel Prize
- award (2008): Josiah Willard Gibbs Lectureship
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c176]Peter Bürgisser, Mahmut Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson:
Complexity of Robust Orbit Problems for Torus Actions and the abc-Conjecture. CCC 2024: 14:1-14:48- [i96]Robert Andrews, Avi Wigderson:
Constant-Depth Arithmetic Circuits for Linear Algebra Problems. CoRR abs/2404.10839 (2024) - [i95]Peter Bürgisser, Mahmut Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson:
Complexity of Robust Orbit Problems for Torus Actions and the abc-conjecture. CoRR abs/2405.15368 (2024) - [i94]Robert Andrews, Avi Wigderson:
Constant-Depth Arithmetic Circuits for Linear Algebra Problems. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c175]Ronen Eldan, Avi Wigderson, Pei Wu:
An Optimal "It Ain't Over Till It's Over" Theorem. STOC 2023: 853-866 - [i93]Yinan Li, Youming Qiao, Avi Wigderson, Yuval Wigderson, Chuanqi Zhang:
On linear-algebraic notions of expansion. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j107]Oded Goldreich, Avi Wigderson:
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing. TheoretiCS 1 (2022) - [c174]Fernando Granha Jeronimo, Tushant Mittal
, Sourya Roy, Avi Wigderson:
Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification. FOCS 2022: 378-388 - [c173]Avi Wigderson:
Non-commutative Optimization - Where Algebra, Analysis and Computational Complexity Meet. ISSAC 2022: 13-19 - [i92]Yinan Li, Youming Qiao, Avi Wigderson, Yuval Wigderson, Chuanqi Zhang:
Connections between graphs and matrix spaces. CoRR abs/2206.04815 (2022) - [i91]Ronen Eldan, Avi Wigderson, Pei Wu:
An Optimal "It Ain't Over Till It's Over" Theorem. CoRR abs/2208.03450 (2022) - [i90]Fernando Granha Jeronimo, Tushant Mittal, Sourya Roy, Avi Wigderson:
Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification. CoRR abs/2209.07024 (2022) - [i89]Yinan Li, Youming Qiao, Avi Wigderson, Yuval Wigderson, Chuanqi Zhang:
On linear-algebraic notions of expansion. CoRR abs/2212.13154 (2022) - 2021
- [j106]Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson:
Proof Complexity Lower Bounds from Algebraic Circuit Complexity. Theory Comput. 17: 1-88 (2021) - [c172]Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson:
On the Power and Limitations of Branch and Cut. CCC 2021: 6:1-6:30 - [c171]Oded Goldreich, Avi Wigderson:
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing. CCC 2021: 12:1-12:74 - [c170]Peter Bürgisser, M. Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson:
Polynomial Time Algorithms in Invariant Theory for Torus Actions. CCC 2021: 32:1-32:30 - [c169]Oded Goldreich, Avi Wigderson:
Non-adaptive vs Adaptive Queries in the Dense Graph Testing Model. FOCS 2021: 269-275 - [i88]Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson:
On the Power and Limitations of Branch and Cut. CoRR abs/2102.05019 (2021) - [i87]Peter Bürgisser, M. Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson:
Polynomial time algorithms in invariant theory for torus actions. CoRR abs/2102.07727 (2021) - [i86]Oded Goldreich, Avi Wigderson:
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing. CoRR abs/2112.00673 (2021) - [i85]Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson:
On the Power and Limitations of Branch and Cut. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j105]Ankit Garg, Leonid Gurvits, Rafael Mendes de Oliveira, Avi Wigderson:
Operator Scaling: Theory and Applications. Found. Comput. Math. 20(2): 223-290 (2020) - [j104]Zeev Dvir, Sivakanth Gopi, Yuzhou Gu, Avi Wigderson:
Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs. SIAM J. Comput. 49(3): 465-496 (2020) - [c168]Ankit Garg, Christian Ikenmeyer, Visu Makam, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings. CCC 2020: 12:1-12:17 - [c167]Visu Makam, Avi Wigderson:
Symbolic determinant identity testing (SDIT) is not a null cone problem; and the symmetries of algebraic varieties. FOCS 2020: 881-888 - [p10]Oded Goldreich, Avi Wigderson:
On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions. Computational Complexity and Property Testing 2020: 41-86 - [i84]Avi Wigderson, Yuval Wigderson:
The uncertainty principle: variations on a theme. CoRR abs/2006.11206 (2020) - [i83]Oded Goldreich, Avi Wigderson:
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing. Electron. Colloquium Comput. Complex. TR20 (2020) - [i82]Oded Goldreich, Avi Wigderson:
Non-adaptive vs Adaptive Queries in the Dense Graph Testing Model. Electron. Colloquium Comput. Complex. TR20 (2020) - [i81]Oded Goldreich, Avi Wigderson:
Constructing Large Families of Pairwise Far Permutations: Good Permutation Codes Based on the Shuffle-Exchange Network. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j103]Or Meir, Avi Wigderson:
Prediction from Partial Information and Hindsight, with Application to Circuit Lower Bounds. Comput. Complex. 28(2): 145-183 (2019) - [c166]Ankit Garg, Visu Makam, Rafael Mendes de Oliveira, Avi Wigderson:
More Barriers for Rank Methods, via a "numeric to Symbolic" Transfer. FOCS 2019: 824-844 - [c165]Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes. FOCS 2019: 845-861 - [c164]Zeev Dvir, Sivakanth Gopi, Yuzhou Gu, Avi Wigderson:
Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs. ITCS 2019: 32:1-32:20 - [p9]Oded Goldreich, Silvio Micali, Avi Wigderson:
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. Providing Sound Foundations for Cryptography 2019: 285-306 - [p8]Oded Goldreich, Silvio Micali, Avi Wigderson:
How to play any mental game, or a completeness theorem for protocols with honest majority. Providing Sound Foundations for Cryptography 2019: 307-328 - [p7]Michael Ben-Or, Shafi Goldwasser, Avi Wigderson:
Completeness theorems for non-cryptographic fault-tolerant distributed computation. Providing Sound Foundations for Cryptography 2019: 351-371 - [p6]Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson:
Multi-prover interactive proofs: how to remove intractability assumptions. Providing Sound Foundations for Cryptography 2019: 373-410 - [i80]Orit E. Raz, Avi Wigderson:
Subspace arrangements, graph rigidity and derandomization through submodular optimization. CoRR abs/1901.09423 (2019) - [i79]Ankit Garg, Visu Makam, Rafael Mendes de Oliveira, Avi Wigderson:
More barriers for rank methods, via a "numeric to symbolic" transfer. CoRR abs/1904.04299 (2019) - [i78]Visu Makam, Avi Wigderson:
Singular tuples of matrices is not a null cone (and, the symmetries of algebraic varieties). CoRR abs/1909.00857 (2019) - [i77]Ankit Garg, Visu Makam, Rafael Mendes de Oliveira, Avi Wigderson:
Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings. CoRR abs/1910.01251 (2019) - [i76]Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Towards a theory of non-commutative optimization: geodesic first and second order methods for moment maps and polytopes. CoRR abs/1910.12375 (2019) - [i75]Ankit Garg, Visu Makam, Rafael Mendes de Oliveira, Avi Wigderson:
Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings. Electron. Colloquium Comput. Complex. TR19 (2019) - [i74]Visu Makam, Avi Wigderson:
Singular tuples of matrices is not a null cone (and, the symmetries of algebraic varieties). Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j102]Emanuele Viola, Avi Wigderson:
Local Expanders. Comput. Complex. 27(2): 225-244 (2018) - [j101]Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson:
Explicit Capacity Approaching Coding for Interactive Communication. IEEE Trans. Inf. Theory 64(10): 6546-6560 (2018) - [c163]Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes. FOCS 2018: 883-897 - [c162]Klim Efremenko, Ankit Garg, Rafael Mendes de Oliveira, Avi Wigderson:
Barriers for Rank Methods in Arithmetic Complexity. ITCS 2018: 1:1-1:19 - [c161]Peter Bürgisser, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Alternating Minimization, Scaling Algorithms, and the Null-Cone Problem from Invariant Theory. ITCS 2018: 24:1-24:20 - [c160]Zeyuan Allen-Zhu, Ankit Garg, Yuanzhi Li, Rafael Mendes de Oliveira, Avi Wigderson:
Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing. STOC 2018: 172-181 - [i73]Zeyuan Allen-Zhu, Ankit Garg, Yuanzhi Li, Rafael Mendes de Oliveira, Avi Wigderson:
Operator Scaling via Geodesically Convex Optimization, Invariant Theory and Polynomial Identity Testing. CoRR abs/1804.01076 (2018) - [i72]Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Efficient algorithms for tensor scaling, quantum marginals and moment polytopes. CoRR abs/1804.04739 (2018) - [i71]Zeev Dvir, Sivakanth Gopi, Avi Wigderson:
Spanoids - an abstraction of spanning structures, and a barrier for LCCs. CoRR abs/1809.10372 (2018) - [i70]Avi Wigderson:
On the nature of the Theory of Computation (ToC). Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j100]Avi Wigderson:
Technical Perspective: Low-depth arithmetic circuits. Commun. ACM 60(6): 91 (2017) - [j99]Dmitry Gavinsky, Or Meir, Omri Weinstein, Avi Wigderson:
Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation. SIAM J. Comput. 46(1): 114-131 (2017) - [j98]Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Superquadratic Lower Bound for 3-Query Locally Correctable Codes over the Reals. Theory Comput. 13(1): 1-36 (2017) - [c159]Zeyuan Allen-Zhu, Yuanzhi Li, Rafael Mendes de Oliveira, Avi Wigderson:
Much Faster Algorithms for Matrix Scaling. FOCS 2017: 890-901 - [c158]Ankit Garg, Leonid Gurvits, Rafael Mendes de Oliveira, Avi Wigderson:
Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling. STOC 2017: 397-409 - [i69]Zeyuan Allen Zhu, Yuanzhi Li, Rafael Mendes de Oliveira, Avi Wigderson:
Much Faster Algorithms for Matrix Scaling. CoRR abs/1704.02315 (2017) - [i68]Klim Efremenko, Ankit Garg, Rafael Mendes de Oliveira, Avi Wigderson:
Barriers for Rank Methods in Arithmetic Complexity. CoRR abs/1710.09502 (2017) - [i67]Avi Wigderson:
Interactions of Computational Complexity Theory and Mathematics. CoRR abs/1710.09780 (2017) - [i66]Peter Bürgisser, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory. CoRR abs/1711.08039 (2017) - [i65]Klim Efremenko, Ankit Garg, Rafael Mendes de Oliveira, Avi Wigderson:
Barriers for Rank Methods in Arithmetic Complexity. Electron. Colloquium Comput. Complex. TR17 (2017) - [i64]Or Meir, Avi Wigderson:
Prediction from Partial Information and Hindsight, with Application to Circuit Lower Bounds. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j97]Tali Kaufman, Avi Wigderson:
Symmetric LDPC codes and local testing. Comb. 36(1): 91-120 (2016) - [j96]Avi Wigderson, Amir Yehudayoff:
Population recovery and partial identification. Mach. Learn. 102(1): 29-56 (2016) - [c157]Parikshit Gopalan, Rocco A. Servedio, Avi Wigderson:
Degree and Sensitivity: Tails of Two Distributions. CCC 2016: 13:1-13:23 - [c156]Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson:
Proof Complexity Lower Bounds from Algebraic Circuit Complexity. CCC 2016: 32:1-32:17 - [c155]Ankit Garg, Leonid Gurvits, Rafael Mendes de Oliveira, Avi Wigderson:
A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing. FOCS 2016: 109-117 - [c154]Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson:
Smooth Boolean Functions are Easy: Efficient Algorithms for Low-Sensitivity Functions. ITCS 2016: 59-70 - [c153]Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson:
Towards Optimal Deterministic Coding for Interactive Communication. SODA 2016: 1922-1936 - [i63]Parikshit Gopalan, Rocco A. Servedio, Avishay Tal, Avi Wigderson:
Degree and Sensitivity: tails of two distributions. CoRR abs/1604.07432 (2016) - [i62]Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson:
Proof Complexity Lower Bounds from Algebraic Circuit Complexity. CoRR abs/1606.05050 (2016) - [i61]Ankit Garg, Leonid Gurvits, Rafael Mendes de Oliveira, Avi Wigderson:
Algorithmic aspects of Brascamp-Lieb inequalities. CoRR abs/1607.06711 (2016) - [i60]Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson:
Proof Complexity Lower Bounds from Algebraic Circuit Complexity. Electron. Colloquium Comput. Complex. TR16 (2016) - [i59]Parikshit Gopalan, Rocco A. Servedio, Avishay Tal, Avi Wigderson:
Degree and Sensitivity: tails of two distributions. Electron. Colloquium Comput. Complex. TR16 (2016) - [i58]Emanuele Viola, Avi Wigderson:
Local Expanders. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j95]Avi Wigderson, Phokion G. Kolaitis:
Invited Articles Foreword. J. ACM 62(5): 41:1 (2015) - [j94]Emmanuel Abbe, Amir Shpilka, Avi Wigderson:
Reed-Muller Codes for Random Erasures and Errors. IEEE Trans. Inf. Theory 61(10): 5229-5252 (2015) - [j93]Pavel Hrubes, Avi Wigderson:
Non-Commutative Arithmetic Circuits with Division. Theory Comput. 11: 357-393 (2015) - [c152]Oded Goldreich, Emanuele Viola, Avi Wigderson:
On Randomness Extraction in AC0. CCC 2015: 601-668 - [c151]Shay Moran, Amir Shpilka, Avi Wigderson, Amir Yehudayoff:
Compressing and Teaching for Low VC-Dimension. FOCS 2015: 40-51 - [c150]Tengyu Ma, Avi Wigderson:
Sum-of-Squares Lower Bounds for Sparse PCA. NIPS 2015: 1612-1620 - [c149]Raghu Meka, Aaron Potechin, Avi Wigderson:
Sum-of-squares Lower Bounds for Planted Clique. STOC 2015: 87-96 - [c148]Emmanuel Abbe, Amir Shpilka, Avi Wigderson:
Reed-Muller Codes for Random Erasures and Errors. STOC 2015: 297-306 - [i57]Shay Moran, Amir Shpilka, Avi Wigderson, Amir Yehudayoff:
Teaching and compressing for low VC-dimension. CoRR abs/1502.06187 (2015) - [i56]Raghu Meka, Aaron Potechin, Avi Wigderson:
Sum-of-squares lower bounds for planted clique. CoRR abs/1503.06447 (2015) - [i55]Tengyu Ma, Avi Wigderson:
Sum-of-Squares Lower Bounds for Sparse PCA. CoRR abs/1507.06370 (2015) - [i54]Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson:
Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions. CoRR abs/1508.02420 (2015) - [i53]Ankit Garg, Leonid Gurvits, Rafael Mendes de Oliveira, Avi Wigderson:
A deterministic polynomial time algorithm for non-commutative rational identity testing. CoRR abs/1511.03730 (2015) - [i52]Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson:
Towards Optimal Deterministic Coding for Interactive Communication. Electron. Colloquium Comput. Complex. TR15 (2015) - [i51]Oded Goldreich, Emanuele Viola, Avi Wigderson:
On Randomness Extraction in AC0. Electron. Colloquium Comput. Complex. TR15 (2015) - [i50]Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson:
Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions. Electron. Colloquium Comput. Complex. TR15 (2015) - [i49]Shay Moran, Amir Shpilka, Avi Wigderson, Amir Yehudayoff:
Teaching and compressing for low VC-dimension. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c147]Pavel Hrubes, Avi Wigderson:
Non-commutative arithmetic circuits with division. ITCS 2014: 49-66 - [c146]Oded Goldreich, Avi Wigderson:
On derandomizing algorithms that err extremely rarely. STOC 2014: 109-118 - [c145]Dmitry Gavinsky, Or Meir, Omri Weinstein, Avi Wigderson:
Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture. STOC 2014: 213-222 - [c144]Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Breaking the quadratic barrier for 3-LCC's over the reals. STOC 2014: 784-793 - [i48]Emmanuel Abbe, Amir Shpilka, Avi Wigderson:
Reed-Muller codes for random erasures and errors. CoRR abs/1411.4590 (2014) - 2013
- [c143]Guy N. Rothblum, Salil P. Vadhan, Avi Wigderson:
Interactive proofs of proximity: delegating computation in sublinear time. STOC 2013: 793-802 - [i47]Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Breaking the quadratic barrier for 3-LCCs over the Reals. CoRR abs/1311.5102 (2013) - [i46]Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Breaking the quadratic barrier for 3-LCCs over the Reals. Electron. Colloquium Comput. Complex. TR13 (2013) - [i45]Dmitry Gavinsky, Or Meir, Omri Weinstein, Avi Wigderson:
Toward Better Formula Lower Bounds: An Information Complexity Approach to the KRW Composition Conjecture. Electron. Colloquium Comput. Complex. TR13 (2013) - [i44]Oded Goldreich, Avi Wigderson:
On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions. Electron. Colloquium Comput. Complex. TR13 (2013) - [i43]Oded Goldreich, Avi Wigderson:
On Derandomizing Algorithms that Err Extremely Rarely. Electron. Colloquium Comput. Complex. TR13 (2013) - [i42]Raghu Meka, Avi Wigderson:
Association schemes, non-commutative polynomial concentration, and sum-of-squares lower bounds for planted clique. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j92]Guy Kindler, Anup Rao, Ryan O'Donnell, Avi Wigderson:
Spherical cubes: optimal foams from computational hardness amplification. Commun. ACM 55(10): 90-97 (2012) - [j91]Russell Impagliazzo, Valentine Kabanets, Avi Wigderson:
New Direct-Product Testers and 2-Query PCPs. SIAM J. Comput. 41(6): 1722-1768 (2012) - [c142]Avi Wigderson, Amir Yehudayoff:
Population Recovery and Partial Identification. FOCS 2012: 390-399 - [c141]Zeev Dvir, Anup Rao, Avi Wigderson, Amir Yehudayoff:
Restriction access. ITCS 2012: 19-33 - [i41]Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Improved rank bounds for design matrices and a new proof of Kelly's theorem. CoRR abs/1211.0330 (2012) - [i40]Albert Ai, Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Sylvester-Gallai type theorems for approximate collinearity. CoRR abs/1211.0331 (2012) - [i39]Albert Ai, Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Sylvester-Gallai type theorems for approximate collinearity. Electron. Colloquium Comput. Complex. TR12 (2012) - [i38]Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Improved rank bounds for design matrices and a new proof of Kelly's theorem. Electron. Colloquium Comput. Complex. TR12 (2012) - [i37]Avi Wigderson, Amir Yehudayoff:
Population Recovery and Partial Identification. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j90]Xi Chen, Neeraj Kayal, Avi Wigderson:
Partial Derivatives in Arithmetic Complexity and Beyond. Found. Trends Theor. Comput. Sci. 6(1-2): 1-138 (2011) - [j89]Zeev Dvir, Avi Wigderson:
Kakeya Sets, New Mergers, and Old Extractors. SIAM J. Comput. 40(3): 778-792 (2011) - [c140]Boaz Barak, Zeev Dvir, Amir Yehudayoff, Avi Wigderson:
Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codes. STOC 2011: 519-528 - [p5]Oded Goldreich, Avi Wigderson:
On the Circuit Complexity of Perfect Hashing. Studies in Complexity and Cryptography 2011: 26-29 - [p4]Oded Goldreich, Salil P. Vadhan, Avi Wigderson:
Simplified Derandomization of BPP Using a Hitting Set Generator. Studies in Complexity and Cryptography 2011: 59-67 - [p3]Oded Goldreich, Noam Nisan, Avi Wigderson:
On Yao's XOR-Lemma. Studies in Complexity and Cryptography 2011: 273-301 - [i36]Zeev Dvir, Anup Rao, Avi Wigderson, Amir Yehudayoff:
Restriction Access. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j88]Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson:
Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors. J. ACM 57(4): 20:1-20:52 (2010) - [j87