An introduction to randomness extractors

An introduction to randomness extractors

Cached

Download Links

by Ronen Shaltiel

Citations:

BibTeX

@MISC{Shaltiel_anintroduction,
    author = {Ronen Shaltiel},
    title = {An introduction to randomness extractors},
    year = {}
}

Bookmark

OpenURL

Abstract

Abstract. We give an introduction to the area of “randomness extraction” and survey the main concepts of this area: deterministic extractors, seeded extractors and multiple sources extractors. For each one we briefly discuss background, definitions, explicit constructions and applications. 1

Citations

197	Randomness is linear in space - Nisan, Zuckerman - 1996
173	Various techniques used in connection with random digits - Neumann - 1951
159	Unbiased bits from sources of weak randomness and probabilistic communication complexity - Chor, Goldreich - 1985
141	The bit extraction problem of t-resilient functions - Chor, Goldreich, et al. - 1985
111	Intersection theorems with geometric consequences - Frankl, Wilson - 1981
111	Recent developments in explicit constructions of extractors,” in Current trends in theoretical computer science. The Challenge of the New Century, vol 1: Algorithms and Complexity - Shaltiel - 2004
93	Simple extractors for all min-entropies and a new pseudorandom generator - Shaltiel, Umans
84	Expanders that beat the eigenvalue bound: explicit construction and applications - Wigderson, Zuckerman - 1999
80	Generating quasi-random sequences from semi-random sources - Santha, Vazirani - 1986
76	Loss-less condensers, unbalanced expanders, and extractors - Ta-Shma, Umans, et al.
72	Computational complexity: A modern approach - Arora, Barak - 2009
72	Extracting all the randomness and reducing the error in Trevisan’s extractors - Raz, Reingold, et al. - 1999
71	Independent unbiased coin flips from a correlated biased source—a finite state Markov chain - Blum - 1986
66	A Chernoff bound for random walks on expander graphs - Gillman - 1998
66	Extractors and pseudorandom generators - Trevisan
52	The efficient construction of an unbiased random sequence - Elias - 1972
50	Bounds for dispersers, extractors, and depth-two supperconcentrators - Radhakrishnan, Ta-Shma - 2000
49	Random polynomial time is equal to slightly-random polynomial time - Vazirani, Vazirani - 1985
48	Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes - Guruswami, Umans, et al. - 2007
48	Randomness-optimal oblivious sampling. Random Structures and Algorithms - ZUCKERMAN - 1997
47	Deterministic extractors for bit-fixing sources and exposureresilient cryptography - Kamp, Zuckerman
46	Eigenvalues and Expansion of Regular Graphs - Kahale - 1995
46	Extractors with weak random seeds - Raz
46	Extracting randomness from samplable distributions - Trevisan, Vadhan - 2000
43	Correcting errors beyond the Guruswami-Sudan radius in polynomial time - Parvaresh, Vardy - 2005
41	Nisan and Avi Wigderson. Hardness vs randomness - Noam - 1994
39	A sum-product estimate in finite fields, and applications. Geometric and Functional Analysis - Bourgain, Katz, et al.
39	Extractor codes - Ta-Shma, Zuckerman
38	More on the sum-product phenomenon in prime fields and its applications - Bourgain - 2005
37	Extractors from Reed-Muller codes - Ta-Shma, Zuckerman, et al. - 2006
31	Extractors for a constant number of polynomially small min-entropy independent sources - Rao - 2006
30	Efficiency consideration in using semi-random sources - Vazirani - 1987
29	Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs - Grolmusz
29	Iterating von Neumann’s procedure for extracting random bits - Peres - 1992
26	The Shannon capacity of a union - Alon - 1998
23	Almost optimal dispersers - Ta-Shma - 1998
19	Deterministic extractors for affine sources over large fields - Gabizon, Raz
15	On the construction of affine extractors - Bourgain
15	Nisan and Amnon Ta-Shma, Extracting Randomness: A Survey and New Constructions - Noam - 1999
15	How to get more mileage from randomness extractors. Random Struct. Algorithms - Shaltiel - 2008
14	Avi Wigderson. Extracting randomness using few independent sources - Barak, Impagliazzo - 2004
13	Explicit or-dispersers with polylogarithmic degree - Saks, Srinivasan, et al. - 1998
12	A sum-product estimate in fields of prime order - Konyagin - 2003
12	Deterministic extractors for small-space sources - Kamp, Rao, et al.
11	Avi Wigderson. Expander graphs and their applications - Hoory, Linial - 2006
10	Constructing Ramsey graphs from boolean function representations - Gopalan - 2006
9	Extractors for low-weight affine sources - Rao - 2009
8	Ronen Shaltiel, Benny Sudakov, and Avi Wigderson. Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors - Barak, Kindler
7	Extensions to the Method of Multiplicities, with applications to Kakeya Sets and Mergers - Dvir, Kopparty, et al.
6	Avi Wigderson. Extractors: optimal up to constant factors - Lu, Reingold, et al. - 2005