The amazing power of pairwise independence (abstract)

References In the currency of random bits, it is far cheaper to generate pairwise independent random variables than completely independent ones. This simple construction, viewed and used in a variety of ways, has found a blizzard of applications in theoretical computer science. I will survey the ideas leading to some of the following applications: (1)

[1]  Friedhelm Meyer auf der Heide,et al.  Dynamic perfect hashing: upper and lower bounds , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[2]  Noam Nisan,et al.  Approximations of general independent distributions , 1992, STOC '92.

[3]  Rajeev Motwani,et al.  The Proba,bilistic Met hod Yields Deterministic Parallel Algori thins , 1989 .

[4]  Michael L. Fredman.  And e.szemer~di.storing a sparse table with o(1) worst case access time , 1982, FOCS 1982.

[5]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[6]  Noam Nisan,et al.  More deterministic simulation in logspace , 1993, STOC.

[7]  Leonid A. Levin,et al.  A hard-core predicate for all one-way functions , 1989, STOC '89.

[8]  Russell Impagliazzo,et al.  How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.

[9]  Avi Wigderson,et al.  Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications , 1993, Comb..

[10]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

[11]  NaorMoni,et al.  Small-bias probability spaces , 1993 .

[12]  Avi Wigderson,et al.  Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing , 1997, Electron. Colloquium Comput. Complex..

[13]  Moni Naor,et al.  Small-Bias Probability Spaces: Efficient Constructions and Applications , 1993, SIAM J. Comput..

[14]  Miklos Santha,et al.  Generating Quasi-random Sequences from Semi-random Sources , 1986, J. Comput. Syst. Sci..

[15]  Leonid A. Levin,et al.  Pseudo-random generation from one-way functions , 1989, STOC '89.

[16]  Miklos Santha,et al.  Generating Quasi-Random Sequences from Slightly-Random Sources (Extended Abstract) , 1984, FOCS.

[17]  Michael Luby.  Removing Randomness in Parallel Computation without a Processor Penalty , 1993, J. Comput. Syst. Sci..

[18]  Noam Nisan,et al.  The computational complexity of universal hashing , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[19]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[20]  Avi Wigderson,et al.  Linear-Size Constant-Depth Polylog-Treshold Circuits , 1991, Inf. Process. Lett..

[21]  Aravind Srinivasan,et al.  Computing with very weak random sources , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[22]  Larry J. Stockmeyer,et al.  The complexity of approximate counting , 1983, STOC.

[23]  Michael E. Saks,et al.  Efficient construction of a small hitting set for combinatorial rectangles in high dimension , 1993, Comb..

[24]  Shafi Goldwasser,et al.  Private coins versus public coins in interactive proof systems , 1986, STOC '86.

[25]  Noga Alon,et al.  Simple Construction of Almost k-wise Independent Random Variables , 1992, Random Struct. Algorithms.

[26]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[27]  Michael Sipser,et al.  A complexity theoretic approach to randomness , 1983, STOC.

[28]  Hugo Krawczyk,et al.  On the Existence of Pseudorandom Generators , 1993, SIAM J. Comput..

[29]  Leonid A. Levin,et al.  No better ways to generate hard NP instances than picking uniformly at random , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[30]  Oded Goldreich,et al.  Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..

[31]  Oded Goldreich,et al.  On the power of two-point based sampling , 1989, J. Complex..

[32]  Bonnie Berger,et al.  Simulating (logcn)-wise independence in NC , 1991, JACM.

[33]  Noam Nisan,et al.  Pseudorandom generators for space-bounded computations , 1990, STOC '90.

[34]  Russell Impagliazzo,et al.  One-way functions are essential for complexity based cryptography , 1989, 30th Annual Symposium on Foundations of Computer Science.

[35]  Richard M. Karp,et al.  A fast parallel algorithm for the maximal independent set problem , 1985, JACM.

[36]  Avi Wigderson,et al.  Tiny families of functions with random properties (preliminary version): a quality-size trade-off for hashing , 1994, STOC '94.

[37]  Vijay V. Vazirani,et al.  Random polynomial time is equal to slightly-random polynomial time , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[38]  Noam Nisan,et al.  RL⊆SC , 1992, STOC '92.

[39]  Oded Goldreich,et al.  Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing (Preliminary Version) , 1997, STOC 1994.