Avi Wigderson - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codesBoaz Barak, Zeev Dvir, Amir Yehudayoff, Avi Wigderson. stoc 2011: 519-528 [doi]

Kakeya Sets, New Mergers, and Old ExtractorsZeev Dvir, Avi Wigderson. siamcomp, 40(3):778-792, 2011. [doi]

On Yao s XOR-LemmaOded Goldreich, Noam Nisan, Avi Wigderson. In Oded Goldreich, editor, Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, . Volume 6650 of Lecture Notes in Computer Science, pages 273-301, Springer, 2011. [doi]

Simplified Derandomization of BPP Using a Hitting Set GeneratorOded Goldreich, Salil P. Vadhan, Avi Wigderson. In Oded Goldreich, editor, Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, . Volume 6650 of Lecture Notes in Computer Science, pages 59-67, Springer, 2011. [doi]

On the Circuit Complexity of Perfect HashingOded Goldreich, Avi Wigderson. In Oded Goldreich, editor, Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, . Volume 6650 of Lecture Notes in Computer Science, pages 26-29, Springer, 2011. [doi]

2010

Public-key cryptography from different assumptionsBenny Applebaum, Boaz Barak, Avi Wigderson. stoc 2010: 171-180 [doi]

Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and ExtractorsBoaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson. eccc, 17:37, 2010. [doi]

Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractorsBoaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson. JACM, 57(4), 2010. [doi]

Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable CodesBoaz Barak, Zeev Dvir, Avi Wigderson, Amir Yehudayoff. eccc, 17:149, 2010. [doi]

Monotone Expanders: Constructions and ApplicationsZeev Dvir, Avi Wigderson. toc, 6(1):291-308, 2010. [doi]

Non-commutative circuits and the sum-of-squares problemPavel Hrubes, Avi Wigderson, Amir Yehudayoff. eccc, 17:21, 2010. [doi]

Non-commutative circuits and the sum-of-squares problemPavel Hrubes, Avi Wigderson, Amir Yehudayoff. stoc 2010: 667-676 [doi]

Relationless completeness and separationsPavel Hrubes, Avi Wigderson, Amir Yehudayoff. eccc, 17:40, 2010. [doi]

Relationless Completeness and SeparationsPavel Hrubes, Avi Wigderson, Amir Yehudayoff. coco 2010: 280-290 [doi]

Uniform Direct Product Theorems: Simplified, Optimized, and DerandomizedRussell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson. siamcomp, 39(4):1637-1665, 2010. [doi]

Symmetric LDPC Codes and Local TestingTali Kaufman, Avi Wigderson. propertytesting 2010: 312-319 [doi]

Symmetric LDPC Codes and Local TestingTali Kaufman, Avi Wigderson. innovations 2010: 406-421 [doi]

2009

Algebrization: A New Barrier in Complexity TheoryScott Aaronson, Avi Wigderson. toct, 1(1), 2009. [doi]

Towards a Study of Low-Complexity GraphsSanjeev Arora, David Steurer, Avi Wigderson. icalp 2009: 119-131 [doi]

Linear Systems over Composite ModuliArkadev Chattopadhyay, Avi Wigderson. focs 2009: 43-52 [doi]

Linear systems over composite moduliArkadev Chattopadhyay, Avi Wigderson. eccc, 16:84, 2009. [doi]

Monotone expanders - constructions and applicationsZeev Dvir, Avi Wigderson. eccc, 16:135, 2009. [doi]

Extractors And Rank Extractors For Polynomial SourcesZeev Dvir, Ariel Gabizon, Avi Wigderson. cc, 18(1):1-58, 2009. [doi]

New direct-product testers and 2-query PCPsRussell Impagliazzo, Valentine Kabanets, Avi Wigderson. stoc 2009: 131-140 [doi]

New Direct-Product Testers and 2-Query PCPsRussell Impagliazzo, Valentine Kabanets, Avi Wigderson. eccc, 16:90, 2009. [doi]

One-way multiparty communication lower bound for pointer jumping with applicationsEmanuele Viola, Avi Wigderson. combinatorica, 29(6):719-743, 2009. [doi]

The work of Leslie ValiantAvi Wigderson. stoc 2009: 1-2 [doi]

Randomness extractors -- applications and constructionsAvi Wigderson. fsttcs 2009: 471-473 [doi]

2008

Algebrization: a new barrier in complexity theoryScott Aaronson, Avi Wigderson. stoc 2008: 731-740 [doi]

Algebrization: A New Barrier in Complexity TheoryScott Aaronson, Avi Wigderson. eccc, 15(005), 2008. [doi]

Kakeya sets, new mergers and old extractorsZeev Dvir, Avi Wigderson. eccc, 15(058), 2008. [doi]

Kakeya Sets, New Mergers and Old ExtractorsZeev Dvir, Avi Wigderson. focs 2008: 625-633 [doi]

Euclidean Sections of with Sublinear Randomness and Error-Correction over the RealsVenkatesan Guruswami, James R. Lee, Avi Wigderson. approx 2008: 444-454 [doi]

Uniform Direct-Product Theorems: Simplified, Optimized, and DerandomizedRussell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson. eccc, 15(079), 2008. [doi]

Uniform direct product theorems: simplified, optimized, and derandomizedRussell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson. stoc 2008: 579-588 [doi]

Neighborly Embedded ManifoldsGil Kalai, Avi Wigderson. dcg, 40(3):319-324, 2008. [doi]

Spherical Cubes and Rounding in High DimensionsGuy Kindler, Ryan O Donnell, Anup Rao, Avi Wigderson. focs 2008: 189-198 [doi]

Norms, XOR Lemmas, and Lower Bounds for Polynomials and ProtocolsEmanuele Viola, Avi Wigderson. toc, 4(1):137-168, 2008. [doi]

Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applicationsAvi Wigderson, David Xiao. toc, 4(1):53-76, 2008. [doi]

Randomness - A Computational Complexity PerspectiveAvi Wigderson. csr 2008: 1-2 [doi]

2007

2006

Extracting Randomness Using Few Independent SourcesBoaz Barak, Russell Impagliazzo, Avi Wigderson. siamcomp, 36(4):1095-1118, 2006. [doi]

2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson constructionBoaz Barak, Anup Rao, Ronen Shaltiel, Avi Wigderson. stoc 2006: 671-680 [doi]

A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of DisjointnessPaul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson. cc, 15(4):391-432, 2006. [doi]

Robust Local Testability of Tensor Products of LDPC CodesIrit Dinur, Madhu Sudan, Avi Wigderson. eccc, 13(118), 2006. [doi]

Robust Local Testability of Tensor Products of LDPC CodesIrit Dinur, Madhu Sudan, Avi Wigderson. approx 2006: 304-315 [doi]

Reducing The Seed Length In The Nisan-Wigderson GeneratorRussell Impagliazzo, Ronen Shaltiel, Avi Wigderson. combinatorica, 26(6):647-681, 2006. [doi]

Extracting Randomness via Repeated CondensingOmer Reingold, Ronen Shaltiel, Avi Wigderson. siamcomp, 35(5):1185-1209, 2006. [doi]

Iterative Construction of Cayley Expander GraphsEyal Rozenman, Aner Shalev, Avi Wigderson. toc, 2(1):91-120, 2006. [doi]

Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applicationsAvi Wigderson, David Xiao. eccc, 13(105), 2006. [doi]

Applications of the Sum-Product Theorem in Finite FieldsAvi Wigderson. cocoon 2006: 111 [doi]

The Power and Weakness of Randomness in ComputationAvi Wigderson. latin 2006: 28-29 [doi]

2005

2004

Pseudorandom Generators in Propositional Proof ComplexityMichael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson. siamcomp, 34(1):67-88, 2004. [doi]

Extracting Randomness Using Few Independent SourcesBoaz Barak, Russell Impagliazzo, Avi Wigderson. focs 2004: 384-393 [doi]

Near Optimal Separation Of Tree-Like And General ResolutionEli Ben-Sasson, Russell Impagliazzo, Avi Wigderson. combinatorica, 24(4):585-603, 2004. [doi]

Expanders In Group AlgebrasRoy Meshulam, Avi Wigderson. combinatorica, 24(4):659-680, 2004. [doi]

A new family of Cayley expanders (?)Eyal Rozenman, Aner Shalev, Avi Wigderson. stoc 2004: 445-454 [doi]

Derandomizing homomorphism testing in general groupsAmir Shpilka, Avi Wigderson. stoc 2004: 427-435 [doi]

Depth through breadth, or why should we attend talks in other areas?Avi Wigderson. stoc 2004: 579 [doi]

2003

2002

Space Complexity in Propositional CalculusMichael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson. siamcomp, 31(4):1184-1211, 2002. [doi]

Randomness Conductors and Constant-Degree Lossless ExpandersMichael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson. cocoon 2002: 15 [doi]

Randomness conductors and constant-degree lossless expandersMichael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson. stoc 2002: 659-668 [doi]

Computing Graph Properties by Randomized Subcube PartitionsEhud Friedgut, Jeff Kahn, Avi Wigderson. random 2002: 105-113 [doi]

Derandomization That Is Rarely Wrong from Short Advice That Is Typically GoodOded Goldreich, Avi Wigderson. random 2002: 209-223 [doi]

Derandomization that is rarely wrong from short advice that is typically goodOded Goldreich, Avi Wigderson. eccc, (039), 2002. [doi]

On interactive proofs with a laconic proverOded Goldreich, Salil P. Vadhan, Avi Wigderson. cc, 11(1-2):1-53, 2002. [doi]

In search of an easy witness: exponential time vs. probabilistic polynomial timeRussell Impagliazzo, Valentine Kabanets, Avi Wigderson. jcss, 65(4):672-694, 2002. [doi]

Expanders from symmetric codesRoy Meshulam, Avi Wigderson. stoc 2002: 669-677 [doi]

Expanders from Symmetric CodesRoy Meshulam, Avi Wigderson. cocoon 2002: 16 [doi]

Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal CalculusAlexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao. combinatorica, 22(4):555-574, 2002. [doi]

2001

Semi-Direct Product in Groups and Zig-Zag Product in Graphs: Connections and ApplicationsNoga Alon, Alexander Lubotzky, Avi Wigderson. focs 2001: 630-637

Short proofs are narrow - resolution made simpleEli Ben-Sasson, Avi Wigderson. JACM, 48(2):149-169, 2001. [doi]

On Interactive Proofs with a Laconic ProverOded Goldreich, Salil P. Vadhan, Avi Wigderson. eccc, 8(46), 2001. [doi]

On Interactive Proofs with a Laconic ProverOded Goldreich, Salil P. Vadhan, Avi Wigderson. icalp 2001: 334-345 [doi]

Simple Analysis of Graph Tests for Linearity and PCPJohan Håstad, Avi Wigderson. cocoon 2001: 244-254 [doi]

Randomness vs Time: Derandomization under a Uniform AssumptionRussell Impagliazzo, Avi Wigderson. jcss, 63(4):672-688, 2001. [doi]

In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial TimeRussell Impagliazzo, Valentine Kabanets, Avi Wigderson. cocoon 2001: 2-12 [doi]

Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and ExtractorsOmer Reingold, Salil P. Vadhan, Avi Wigderson. eccc, 8(18), 2001. [doi]

Depth-3 arithmetic circuits over fields of characteristic zeroAmir Shpilka, Avi Wigderson. cc, 10(1):1-27, 2001. [doi]

2000

PreviousNext