Pairwise Independence and Derandomization

Pairwise Independence and Derandomization (2006)

Cached

Download Links

by Michael Luby , Avi Wigderson

Citations:

BibTeX

@MISC{Luby06pairwiseindependence,
    author = {Michael Luby and Avi Wigderson},
    title = {Pairwise Independence and Derandomization},
    year = {2006}
}

Bookmark

OpenURL

Abstract

Citations

1950	Computational complexity - Papadimitriou - 1994
1001	Probabilistic encryption - Goldwasser, Micali - 1984
601	A pseudorandom generator from any one-way function - H˚astad, Impagliazzo, et al. - 1999
544	How to construct random functions - Goldreich, Goldwasser, et al. - 1986
533	How to generate cryptographically strong sequences of pseudorandom bits - Blum, Micali - 1984
453	Theory and applications of trapdoor functions - Yao - 1982
413	Introduction to the Theory of Computation - Sipser - 1997
409	The complexity of computing the permanent - Valiant - 1979
334	A simple parallel algorithm for the maximal independent set problem - Luby - 1986
284	New Hash Functions and their Use in Authentication and Set Equality - Wegman, Carter - 1981
250	Hardness vs. Randomness - Nisan, Wigderson - 1988
193	A fast and simple randomized parallel algorithm for the maximal independent set problem - Alon, Babai, et al.
185	Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators - Margulis - 1988
185	NP is as easy as detecting unique solutions - Valiant, Vazirani - 1986
167	Separating the Polynomial-Time Hierarchy by Oracles - Yao - 1985
163	Computational Limitations for Small Depth Circuits - H˚astad - 1987
156	Probability Theory - Rényi - 1970
120	C.: RSA and Rabin Functions: Certain Parts are as Hard as the Whole - Alexi, Chor, et al. - 1988
115	circuits, and the polynomial time hierarchy - FURST, SAXE, et al.
92	Σ 1 1-formulae on finite structures - Ajtai - 1983
87	Two theorems on random polynomial time - Adleman - 1978
86	deterministic amplification, and weak random sources - Cohen, Wigderson, et al. - 1989
75	Monte-carlo approximation algorithms for enumeration problems - Karp, Luby, et al. - 1989
73	Explicit expanders and the Ramanujan conjectures - Lubotzky, Phillips, et al. - 1986
60	Hard-core Predicates for any One-Way Function - Goldreich, Levin - 1989
56	Pseudorandom bits for constant depth circuits - Nisan - 1991
43	With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy - Cai - 1989
37	More deterministic simulation in Logspace - Nisan, Zuckerman - 1993
33	Deterministic simulation - Ajtai, Komlós, et al. - 1987
20	Relative to a random oracle A, P A 6= NP A 6= co \Gamma NP A with probability 1 - Bennett, Gill - 1981
18	On the power of two-point sampling - CnOR, GOLDREICH - 1989
13	Monte-Carlo algorithms for the planar multiterminal network reliability problem - Karp, Luby - 1985
9	How to recycle random bits. FOCS - Impagliazzo, Zuckerman - 1989
8	Private Coins vs. Public Coins in Interactive Proof Systems - Goldwasser, Sipser - 1986
7	A Hard-Core Predicate for any One-Way Function. STOC - Goldreich, Levin - 1989
6	Approximating the number of solutions to a GF[2] formula - Karpinski, Luby - 1993
6	More deterministic simulation - Nisan, Zuckerman - 1993
5	Storing a sparse table in O(1) worst case access time - Fredman, Komlos, et al. - 1984
4	A complexity theoretic approach to randomness," STOC - Sipser - 1983
4	A complexity theoretic approach to randomness”, STOC pp - Sipser - 1983
4	Theory and Applications of Trapdoor Functions,” FOCS - Yao - 1982
3	Expanders, Randomness, or Time versus Space - Karp, Pippenger, et al. - 1986
2	How to recycle random bits," FOCS - Impagliazzo, Zuckerman - 1990
2	appears in: M. Sipser, "Expanders, Randomness, or Time versus Space - Karp, Pippenger, et al. - 1986
2	RL ` SC," STOC - Nisan - 1992
2	Expander graphs and their applications. Bulletin (new series - Hoory, Linial, et al. - 2006