WorldCat Identities

Wigderson, Avi

Overview
Works: 42 works in 119 publications in 2 languages and 504 library holdings
Roles: Author, Editor
Publication Timeline
.
Most widely held works by Avi Wigderson
Computational complexity theory by Steven Rudich( Book )

8 editions published in 2004 in English and held by 246 WorldCat member libraries worldwide

"This volume is recommended for independent study and is suitable for graduate students and researchers interested in computational complexity."--Jacket
Pairwise independence and derandomization by Michael George Luby( )

10 editions published between 1995 and 2007 in English and held by 68 WorldCat member libraries worldwide

The article is based on a series of lectures given by the authors in 1995, where the notes were scribed by the attending students. (The detailed list of scribes and other contributors can be found in the Acknowledgements section at the end of the manuscript.) The current version is essentially the same, with a few minor changes. We note that this publication takes place a decade after the lectures were given. Much has happened in the area of pseudorandomness and derandomization since, and perhaps a somewhat different viewpoint, different material, and different style would be chosen were these lectures given today. Still, the material presented is self contained, and is a prime manifestation of the "derandomization" paradigm. The material does lack references to newer work though. We recommend the reader interested in randomness, derandomization and their interplay with computational complexity to consult the following books and surveys, as well as their extensive bibliography
Partial derivatives in arithmetic complexity and beyond by Xi Chen( )

5 editions published between 2011 and 2014 in English and held by 56 WorldCat member libraries worldwide

How complex is a given multivariate polynomial? The main point of this survey is that one can learn a great deal about the structure and complexity of polynomials by studying (some of) their partial derivatives. The bulk of the survey shows that partial derivatives provide essential ingredients in proving both upper and lower bounds for computing polynomials by a variety of natural arithmetic models. We will also see applications which go beyond computational complexity, where partial derivatives provide a wealth of structural information about polynomials (including their number of roots, reducibility and internal symmetries), and help us solve various number theoretic, geometric, and combinatorial problems
How to share memory in a distributed system by Eli Upfal( Book )

6 editions published in 1984 in English and held by 13 WorldCat member libraries worldwide

We study the power of shared memory in models of parallel computation. We describe a novel distributed data structure that eliminates the need for shared memory without significantly increasing the run time of the parallel computation. More specifically we show how a complete network of processors can deterministicly simulate one PRAM step in O(log n(loglog n)2) time, when both models use n processors, and the size of the PRAM's shared memory is polynomial in n. The best previously known upper bound was the trivial O(n). We also establish that this upper bounds is nearly optimal. We prove that an online simulation of T PRAM steps by a complete network of processors requires omega(T log n) time/loglog n. A simple consequence of the upper bound is that an Ultracomputer (the only currently feasible general purpose parallel machine), can simulate one step of a PRAM (the most convenient parallel model to program), in ()((log n loglog n)2) steps
Constructing a perfect matching is in random NC by Richard M Karp( Book )

4 editions published in 1985 in English and held by 8 WorldCat member libraries worldwide

This document shows that the problem of constructing a perfect matching in a graph is in the complexity class Random NC; i.e., the problem is solvable in polylog time by a randomized parallel algorithm using a polynomial-bounded number of processors. It is also shown that several related problems lie in Random NC. These include: Constructing a perfect matching of maximum weight in a graph whose edge weights are given in unary notation; Constructing a maximum-cardinality matching; Constructing a matching covering a set of vertices of maximum weight in a graph whose vertex weights are given in binary; and Constructing a maximum s-t flow in a directed graph whose edge weights are given in unary. Additional keywords: rank functions. (Author)
The complexity of parallel search by Richard M Karp( Book )

4 editions published in 1986 in English and held by 8 WorldCat member libraries worldwide

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proofs : Revised version of TR 498 by Oded Goldreich( Book )

7 editions published between 1988 and 1989 in English and held by 7 WorldCat member libraries worldwide

On the second eigenvalue of hypergraphs by Joel Friedman( Book )

4 editions published between 1989 and 1992 in English and held by 7 WorldCat member libraries worldwide

On read-once thershold formulae and their randomized decision tree complexity by Universiṭah ha-ʻIvrit bi-Yerushalayim( Book )

4 editions published in 1992 in English and held by 5 WorldCat member libraries worldwide

Another structural result we obtain is that a read-once threshold formula uniquely represents the function it computes."
N[Omega](log n) lower bounds on the size of depth 3 threshold circuits with AND gates at the bottom by Alexander Razborov( Book )

3 editions published in 1992 in English and held by 5 WorldCat member libraries worldwide

Abstract: "We present a function in ACC⁰ such that any depth 3 threshold circuit which computes this function and has AND gates at the bottom must have size n[superscript [omega](log n)]."
Deterministic simulation of probabilistic constant depth circuits by Thomas J. Watson IBM Research Center( Book )

5 editions published between 1985 and 1986 in English and held by 5 WorldCat member libraries worldwide

Monotone circuits for matching require linear depth by Ran Raz( Book )

3 editions published in 1992 in English and held by 5 WorldCat member libraries worldwide

Composition of the universal relation by Johan Håstad( Book )

3 editions published in 1992 in English and held by 5 WorldCat member libraries worldwide

Abstract: "We prove that the communication complexity of the k- fold composition of the universal relation on n bits is (1 - o(1))kn when k= o([square root of n/log n])."
On computation with integer division by Bettina Just( Book )

2 editions published in 1987 in German and English and held by 4 WorldCat member libraries worldwide

Tiny families of functions with random properties : a quality- size trade-off for hashing by Oded Goldreich( Book )

2 editions published in 1994 in English and held by 4 WorldCat member libraries worldwide

Abstract: "We present three explicit constructions of hash functions, which exhibit a trade-off between the size of the family (and hence the number of random bits needed to generate a member of the family), and the quality (or error parameter) of the pseudo-random property it achieves. Unlike previous constructions, most notably universal hashing, the size of our families is essentially independent of the size of the domain on which the functions operate. The first construction is for the mixing property -- mapping a proportional part of any subset of the domain to any other subset. The other two are for the extraction property -- mapping any subset of the domain almost uniformly into a range smaller than it. The second and third constructions handle (respectively) the extreme situations when the range is very large or very small. We provide lower bounds showing our constructions are nearly optimal, and mention some applications of the new constructions."
Rounds in communication complexity revisited by Noam Nisan( Book )

3 editions published in 1992 in English and held by 4 WorldCat member libraries worldwide

Information theoretic reasons for computational difficulty or communication complexity for circuit complexity by Avi Wigderson( Book )

3 editions published in 1992 in English and held by 4 WorldCat member libraries worldwide

Randomized vs. deterministic decision tree complexity for read-once Boolean functions by Universiṭah ha-ʻIvrit bi-Yerushalayim( Book )

3 editions published in 1992 in English and held by 4 WorldCat member libraries worldwide

The tree model for hashing : lower and upper bounds by José Gil de Palomar( Book )

2 editions published in 1991 in English and held by 3 WorldCat member libraries worldwide

Except for extremely unlikely events, every input set of size n will have members for which [omega](lg lg n) applications of a hash function are required. From a parallel perspective it can be said that n processors need [omega](lg lg n) expected time to hash themselves into O(n) space, although serial algorithms exist that achieve constant amortized time for insertion, as well as constant worst case search time [16]. Three variants of the basic model, which represent common hashing practice, are defined and tight bounds are presented for them as too [sic]. The most striking conclusion that can be drawn from the bounds is that, under all combinations of model variants, not all keys may be hashed in constant time."
One-way functions are essential for non-trivial zero-knowledge by Rafail Ostrovsky( Book )

2 editions published in 1993 in English and held by 3 WorldCat member libraries worldwide

Abstract: "It was known that if one-way functions exist, then there are zero-knowledge proofs for every language in PSPACE. We prove that unless very weak one-way functions exist, Zero-Knowledge proofs can be given only for languages in BPP. For average-case definitions of BPP we prove an analagous result under the assumption that uniform one-way functions do not exist. Thus, very loosely speaking, zero-knowledge is either useless (exists only for 'easy' languages), or universal (exists for every provable language)."
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.70 (from 0.66 for Pairwise i ... to 0.91 for Proofs tha ...)

Computational complexity theory
Covers
Pairwise independence and derandomization
Alternative Names
Avi Wigderson

Avi Wigderson Israeli mathematician and computer scientist

Avi Wigderson israelischer Mathematiker und Informatiker

Avi Wigderson izraelský matematik, informatik

Avi Wigderson matemático, profesor e informático teórico israelí

Avi Wigderson wiskundige uit Israël

Вигдерсон, Ави

آوی ویقدرسون

آوی ویگدرسون ریاضی‌دان و دانشمند علوم کامپیوتر اسرائیلی

アヴィ・ヴィグダーソン

Languages
English (82)

German (1)