#### Filter Results:

- Full text PDF available (176)

#### Publication Year

1957

2018

- This year (10)
- Last 5 years (34)
- Last 10 years (76)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Oded Goldreich, Silvio Micali, Avi Wigderson
- STOC
- 1987

We present a polynomial-time algorithm that, given as a input the description of a game with <italic>incomplete information and any number of players</italic>, produces a protocol for playing theâ€¦ (More)

- Michael Ben-Or, Shafi Goldwasser, Avi Wigderson
- STOC
- 1988

Every function of <italic>n</italic> inputs can be efficiently computed by a complete network of <italic>n</italic> processors in such a way that:<list><item>If no faults occur, no set of sizeâ€¦ (More)

- Noam Nisan, Avi Wigderson
- J. Comput. Syst. Sci.
- 1994

We present a simple new construction of a pseudorandom bit generator, based on the constant depth generators of [N]. It stretches a short string of truly random bits into a long string that looksâ€¦ (More)

It is traditional to view NP as the class of languages whose elements posses short proofs of membership. A "proof that x E L " is a witness W x such that P L (x ,wx)=l where P L is a polynomiallyâ€¦ (More)

- Eli Ben-Sasson, Avi Wigderson
- STOC
- 1999

The <italic>width</italic>of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (=size), in bothâ€¦ (More)

A major consideration we had in writing this survey was to make it accessible to mathematicians as well as to computer scientists, since expander graphs, the protagonists of our story, come up inâ€¦ (More)

- Mauricio Karchmer, Avi Wigderson
- STOC
- 1988

We prove that every monotone circuit which tests <italic>st</italic>-connectivity of an undirected graph on <italic>n</italic> nodes has depth &OHgr;(log<supscrpt>2</supscrpt><italic>n</italic>).â€¦ (More)

- Mauricio Karchmer, Avi Wigderson
- Structure in Complexity Theory Conference
- 1993

We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexity and cryptography:â€¦ (More)

- Russell Impagliazzo, Avi Wigderson
- STOC
- 1997

Russell Impagliazzo* Avi Wigdersont Department of Computer Science Institute of Computer Science University of California Hebrew University San Diego, CA 91097-0114 Jerusalem, Israel russell@csâ€¦ (More)

- Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson
- STOC
- 1988

Quite complex cryptographic machinery has been developed based on the assumption that one-way functions exist, yet we know of only a few possible such candidates. It is important at this time to findâ€¦ (More)