Searching for authors named "Avi Wigderson" – sorted by Relevance.
-
A randomness-efficient sampler for matrix-valued functions and applications
- A Randomness-Efficient Sampler for Matrix-valued Functions and Applications Avi Wigderson
- Cited by 4 (2 self) – Add To MetaCart
-
The complexity of graph connectivity
- The Complexity of Graph Connectivity Avi Wigderson Hebrew University and Princeton University
- Cited by 27 (1 self) – Add To MetaCart
-
The Fusion Method for Lower Bounds in Circuit Complexity
- The Fusion Method for Lower Bounds in Circuit Complexity Avi Wigderson May 27, 1993 Abstract
- Cited by 6 (0 self) – Add To MetaCart
-
Public Key Cryptography from Different Assumptions
- Public Key Cryptography from Different Assumptions Boaz Barak ∗ Avi Wigderson † August 2, 2008
- Add To MetaCart
-
Theory of Computing: A Scientific Perspective
- Theory of Computing: A Scientific Perspective 1 (preliminary version) Oded Goldreich 2 Avi
- Add To MetaCart
-
Kakeya
- Kakeya sets, new mergers and old extractors Zeev Dvir ∗ Avi Wigderson † Abstract A merger is a
- Add To MetaCart
-
Universal traversal sequences for expander graphs
- Universal Traversal Sequences for Expander Graphs Shlomo Hoory Avi Wigderson Hebrew University
- Cited by 11 (0 self) – Add To MetaCart
-
Derandomizing the aw matrix-valued chernoff bound using pessimistic estimators and applications
- Avi Wigderson David Xiao August 31, 2006 Abstract Ahlswede and Winter [AW02] introduced a Chernoff
- Cited by 2 (0 self) – Add To MetaCart
-
Boolean Complexity Classes Vs. Their Arithmetic Analogs
- @(email omitted); with subject 'help eccc' Boolean complexity classes vs. their arithmetic analogs Anna G'al Avi Wigderson y
- Cited by 4 (1 self) – Add To MetaCart
-
Lower Bounds on Formula Size of Boolean Functions using Hypergraph-Entropy
- Lower Bounds on Formula Size of Boolean Functions using Hypergraph-Entropy Ilan Newman Avi
- Cited by 3 (0 self) – Add To MetaCart

