Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors
暂无分享,去创建一个
[1] Avi Wigderson,et al. Extractors: optimal up to constant factors , 2003, STOC '03.
[2] Miklos Santha,et al. Generating Quasi-Random Sequences from Slightly-Random Sources (Extended Abstract) , 1984, FOCS.
[3] Oded Goldreich,et al. The bit extraction problem or t-resilient functions , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[4] Amnon Ta-Shma,et al. Lossless Condensers, Unbalanced Expanders, And Extractors , 2007, Comb..
[5] Ran Raz,et al. Improved Randomness Extraction from Two Independent Sources , 2004, APPROX-RANDOM.
[6] J. Bourgain,et al. MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS , 2005 .
[7] Oded Goldreich,et al. Three XOR-Lemmas - An Exposition , 1995, Electron. Colloquium Comput. Complex..
[8] Ran Raz,et al. Extractors with weak random seeds , 2005, STOC '05.
[9] Manuel Blum. Independent unbiased coin flips from a correlated biased source—A finite state markov chain , 1986, Comb..
[10] Elchanan Mossel,et al. On the complexity of approximating the VC dimension , 2002, J. Comput. Syst. Sci..
[11] Peter Frankl,et al. Intersection theorems with geometric consequences , 1981, Comb..
[12] Ronen Shaltiel,et al. True Random Number Generators Secure in a Changing Environment , 2003, CHES.
[13] Avi Wigderson,et al. Extracting Randomness Using Few Independent Sources , 2006, SIAM J. Comput..
[14] Terence Tao,et al. A sum-product estimate in finite fields, and applications , 2003, math/0301343.
[15] Enkatesan G Uruswami. Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes , 2008 .
[16] Anup Rao,et al. Extractors for a constant number of polynomially small min-entropy independent sources , 2006, STOC '06.
[17] Ronen Shaltiel,et al. Recent Developments in Explicit Constructions of Extractors , 2002, Bull. EATCS.
[18] Oded Goldreich,et al. The Bit Extraction Problem of t-Resilient Functions (Preliminary Version) , 1985, FOCS.
[19] Ran Raz,et al. Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed , 2006, SIAM J. Comput..
[20] Ronen Shaltiel,et al. Increasing the Output Length of Zero-Error Dispersers , 2008, APPROX-RANDOM.
[21] David Zuckerman,et al. General weak random sources , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[22] Chun-Yen Shen,et al. Garaev's inequality in Finite Fields not of prime order , 2008 .
[23] Avi Wigderson,et al. 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction , 2006, STOC '06.
[24] Amnon Ta-Shma,et al. On extracting randomness from weak random sources (extended abstract) , 1996, STOC '96.
[25] A. Wigderson,et al. ENTROPY WAVES, THE ZIG-ZAG GRAPH PRODUCT, AND NEW CONSTANT-DEGREE , 2004, math/0406038.
[26] Avi Wigderson,et al. Randomness conductors and constant-degree lossless expanders , 2002, STOC '02.
[27] Benny Pinkas,et al. On the Impossibility of Private Key Cryptography with Weakly Random Keys , 1990, CRYPTO.
[28] Amnon Ta-Shma,et al. On Extracting Randomness From Weak Random Sources , 1995, Electron. Colloquium Comput. Complex..
[29] Nathan Linial,et al. Collective Coin Flipping , 1989, Advances in Computational Research.
[30] Avi Wigderson,et al. Extracting Randomness via Repeated Condensing , 2006, SIAM J. Comput..
[31] Umesh V. Vazirani,et al. Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources , 1987, Comb..
[32] David Zuckerman. Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number , 2007, Theory Comput..
[33] Luca Trevisan,et al. Extracting randomness from samplable distributions , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[34] Oded Goldreich,et al. Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..
[35] Ran Raz,et al. On recycling the randomness of states in space bounded computation , 1999, STOC '99.
[36] Avi Wigderson,et al. Dispersers, deterministic amplification, and weak random sources , 1989, 30th Annual Symposium on Foundations of Computer Science.
[37] David Zuckerman,et al. DETERMINISTIC EXTRACTORS FOR BIT-FIXING SOURCES AND EXPOSURE-RESILIENT CRYPTOGRAPHY , 2003 .
[38] Joel H. Spencer,et al. On the (non)universality of the one-time pad , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..