- Combinatorial Characterization of Read-Once Formulae M. Karchmer
- A new NC Algorithm for Perfect Matching in Bipartite Cubic Graphs
- On the Power of Randomization in Online Algorithms #
- Depth-3 Arithmetic Circuits over Fields of Characteristic Zero Amir Shpilka y Avi Wigderson z
- Robust local testability of tensor products of LDPC Irit Dinur 1 , Madhu Sudan 2 , and Avi Wigderson 3
- Derandomization that is rarely wrong from short advice that is typically good
- Improved derandomization of BPP using a hitting set generator
- Characterizing Non-Deterministic Circuit Size (Four variations on one theme)
- A Randomness-Efficient Sampler for Matrix-valued Functions and Applications Avi Wigderson
- On the Complexity of Bilinear Forms # Noam Nisan +
- An Analysis of a Simple Genetic Algorithm Yuri Rabinovich
- Computing graph properties by randomized subcube partitions
- SIAM J. COMPUT. c 2010 Society for Industrial and Applied Mathematics
- Search Problems in the Decision Tree Model Laszlo Lovasz #
- KAKEYA SETS, NEW MERGERS AND OLD EXTRACTORS WEIZMANN INSTITUTE OF SCIENCE
- Linear systems over composite moduli Arkadev Chattopadhyay
- How to ShareMemory in a Distributed System Stan$ord University, Stunford, Californiu
- Rounds in Communication Complexity Revisited Hebrew University
- Characterizing NonDeterministic Circuit Size (Four variations on one theme)
- Deterministic Amplification of Space-Bounded Probabilistic Algorithms Ziv Bar-Yossef
- New DirectProduct Testers and 2Query PCPs Russell Impagliazzo # Valentine Kabanets + Avi Wigderson #
- The Complexity of Graph Connectivity Avi Wigderson
- ReadOnce Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus
- Computing graph properties by randomized subcube partitions
- Monotone Circuits for Matching Require Linear Depth
- Quadratic Dynamical Systems (Preliminary Version) +
- Derandomized Graph Products Noga Alon # Uriel Feige + Avi Wigderson # David Zuckerman
- Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus
- Direct Product Results and the GCD Problem, in Old and New Communication Models
- On Pseudorandomness w.r.t Deterministic Observers Oded Goldreich
- KAKEYA SETS, NEW MERGERS AND OLD EXTRACTORS WEIZMANN INSTITUTE OF SCIENCE
- Randomness vs. Time: Derandomization under a uniform assumption
- Semidirect product in groups and Zigzag product in graphs
- Spherical Cubes and Rounding in High Dimensions Guy Kindler #
- Algebrization: A New Barrier in Complexity Theory Scott Aaronson #
- An Analysis of a Simple Genetic Algorithm Yuri Rabinovich
- Discrepancy Sets and Pseudorandom Generators for Combinatorial Rectangles \Lambda
- Direct Product Results and the GCD Problem, in Old and New Communication Models
- PublicKey Cryptography from Di#erent Assumptions Benny Applebaum # Boaz Barak + Avi Wigderson #
- On Span Programs M. Karchmer \Lambda A. Wigderson
- On Rank vs. Communication Complexity Noam Nisan
- Techniques for Bounding the Convergence Rate of Genetic Yuri Rabinovich Avi Wigderson y
- New DirectProduct Testers and 2Query PCPs Russell Impagliazzo # Valentine Kabanets + Avi Wigderson #
- Near-Optimal conversion of Hardness into Pseudo-Randomness Russell Impagliazzo
- On Yao's XORLemma Oded Goldreich y
- One-way multi-party communication lower bound for pointer jumping with applications
- Composition of the Universal Relation Johan Hastad
- Self-Testing/Correcting for Polynomials and for Approximate Peter Gemmell
- In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time
- On Span Programs M. Karchmer
- Lower Bounds on Formula Size of Boolean Functions using Hypergraph-Entropy
- Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors #
- Universal Traversal Sequences for Expander Shlomo Hoory
- Iterative construction of Cayley Expander graphs Eyal Rozenman # Aner Shalev + Avi Wigderson # .
- Undirected Connectivity in O(log1.5 Noam Nisan Endre Szemeredi Avi Wigderson
- Semi-direct product in groups and Zig-zag product in graphs
- Linear systems over composite moduli Arkadev Chattopadhyay #
- On the work of Madhu Sudan Avi Wigderson
- Expanders that Beat the Eigenvalue Bound: Explicit Construction and Applications \Lambda
- Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors
- Linear systems over composite moduli Arkadev Chattopadhyay
- THEORY OF COMPUTING, Volume 4 (2008), pp. 137168 http://theoryofcomputing.org
- Norms, XOR lemmas, and lower bounds for GF(2) polynomials and multiparty Emanuele Viola
- Algebrization: A New Barrier in Complexity Theory Scott Aaronson
- Kakeya sets, new mergers and old extractors Weizmann institute of science
- Discrete Comput Geom DOI 10.1007/s00454-008-9065-y
- One-way multi-party communication lower bound for pointer jumping with applications
- Computational Hardness and Explicit Constructions of Error Correcting Codes
- Iterative construction of Cayley Expander graphs Eyal Rozenman
- A new family of Cayley expanders (?) Eyal Rozenman
- THE QUANTUM COMMUNICATION COMPLEXITY OF ANDRIS AMBAINIS , LEONARD J. SCHULMAN , AMNON TA-SHMA , UMESH
- Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the
- ON INTERACTIVE PROOFS WITH A LACONIC PROVER
- Randomness Conductors and Constant-Degree Expansion Beyond the Degree / 2 Barrier
- Discrepancy Sets and Pseudorandom Generators for Combinatorial Michael Saks
- On the Complexity of Bilinear Forms Noam Nisan
- Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs
- Derandomized Graph Products Uriel Feige
- On Yao's XOR-Lemma Oded Goldreichy Noam Nisanz Avi Wigdersonx
- Pseudorandomness for Network Algorithms Russell Impagliazzo
- On the Power of Randomization in Online Algorithms
- Non-deterministic Communication Complexity with Few Witnesses
- Quadratic Dynamical Systems (Preliminary Version)
- The Complexity of Graph Connectivity Avi Wigderson
- Search Problems in the Decision Tree Model Laszlo Lovasz
- Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes
- Randomness vs. Time: De-randomization under a uniform assumption
- Algebrization: A New Barrier in Complexity Theory Scott Aaronson
- Proofs that Yield Nothing But Their Validity All Languages in NP Have Zero-Knowledge
- A Fast Parallel Algorithm for the Maximal Independent !SetProblem
- Extractors and Rank Extractors for Polynomial Sources Weizmann Institute of Science
- 2Source Dispersers for SubPolynomial Entropy and Ramsey Graphs Beating the FranklWilson Construction
- A new family of Cayley expanders (?) Eyal Rozenman #
- Composition of the Universal Relation Johan Hastad # Avi Wigderson +
- Universal Traversal Sequences for Expander Shlomo Hoory
- Combinatorial Characterization of ReadOnce Formulae M. Karchmer #
- A RandomnessEfficient Sampler for Matrixvalued Functions and Applications Avi Wigderson
- NL/poly ` \PhiL/poly (Preliminary Version)
- On the work of Madhu Sudan Avi Wigderson
- Near-Optimal conversion of Hardness into Pseudo-Randomness Russell Impagliazzo
- Monotone expanders -constructions and applications Avi Wigderson
- One-Way Functions are Essential for Non-Trivial Zero-Knowledge
- New Direct-Product Testers and 2-Query PCPs Russell Impagliazzo
- Reducing the seed length in the Nisan-Wigderson generator Russell Impagliazzo
- Extracting Randomness Using Few Independent Sources Russell Impagliazzo
- BPP HAS SUBEXPONENTIAL TIME SIMULATIONS
- P , NP and mathematics --a computational complexity perspective
- Non-deterministic Communication Complexity with Few Witnesses
- Monotone Circuits for Matching Require Linear Depth
- Space Complexity in Propositional Calculus Michael Alekhnovich , Eli Ben-Sasson y
- Extractors and Rank Extractors for Polynomial Sources Ariel Gabizon
- Search Problems in the Decision Tree Model Laszlo Lovasz
- Algebrization: A New Barrier in Complexity Theory Scott Aaronson #
- Kakeya sets, new mergers and old extractors Weizmann institute of science
- On Rank vs. Communication Complexity # Noam Nisan + Avi Wigderson #
- Towards a study of lowcomplexity graphs # Sanjeev Arora, David Steurer, and Avi Wigderson
- Rounds in Communication Complexity Revisited Noam Nisan #
- In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time
- Deterministic Approximate Counting of Depth2 Circuits Michael Luby \Lambda Boban Velickovi'c y Avi Widgerson z
- P=BPP unless E has subexponential circuits: Derandomizing the XOR Lemma
- Undirected Connectivity in O(log 1.5 n) Space # Noam Nisan Endre Szemeredi Avi Wigderson
- SelfTesting/Correcting for Polynomials and for Approximate Peter Gemmell # Richard Lipton + Ronitt Rubinfeld #
- Symmetric LDPC codes and local testing Tali Kaufman
- [23] V. D. Milman and G. Schechtman. Asymptotic Theory of Finite Dimensional Normed Spaces. Number 1200 in Lecture Notes in Mathematics. Springer Verlag, New York,
- Euclidean sections of # N 1 with sublinear
- A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
- New Direct-Product Testers and 2-Query PCPs Russell Impagliazzo
- THEORY OF COMPUTING, Volume 4 (2008), pp. 137--168 http://theoryofcomputing.org
- OneWay Functions are Essential for NonTrivial ZeroKnowledge
- Extractors and Rank Extractors for Polynomial Sources Zeev Dvir # Ariel Gabizon + Avi Wigderson #
- Monotone expanders -constructions and applications Avi Wigderson
- Entropy Waves, The Zig-Zag Graph Product, and New Constant-Degree Expanders
- THEORY OF COMPUTING, Volume 4 (2008), pp. 5376 http://theoryofcomputing.org
- Extracting Randomness Using Few Independent Sources Boaz Barak # Russell Impagliazzo + Avi Wigderson #
- The Fusion Method for Lower Bounds in Circuit Complexity
- Pseudorandomness for Network Algorithms Russell Impagliazzo # Noam Nisan + Avi Wigderson #
- Lower Bounds on Formula Size of Boolean Functions using HypergraphEntropy
- P=BPP unless E has sub-exponential circuits: Derandomizing the XOR Lemma
- Symmetric LDPC codes and local testing Tali Kaufman
- Monotone expanders constructions and applications Zeev Dvir # Avi Wigderson #
- A STRONG DIRECT PRODUCT THEOREM FOR CORRUPTION AND THE
