Extractors: optimal up to constant factors
暂无分享,去创建一个
Avi Wigderson | Omer Reingold | Chi-Jen Lu | Salil P. Vadhan | A. Wigderson | S. Vadhan | O. Reingold | Chi-Jen Lu
[1] Avi Wigderson,et al. Extracting randomness via repeated condensing , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[2] Avi Wigderson,et al. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[3] Oded Goldreich,et al. A Sample of Samplers - A Computational Perspective on Sampling (survey) , 1997, Electron. Colloquium Comput. Complex..
[4] L. Fortnow. Recent Developments in Explicit Constructions of Extractors , 2002 .
[5] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 1992, computational complexity.
[6] Richard J. Lipton,et al. New Directions In Testing , 1989, Distributed Computing And Cryptography.
[7] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[8] Jonathan Katz,et al. On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.
[9] Oded Goldreich,et al. Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..
[10] Joan Feigenbaum,et al. Hiding Instances in Multioracle Queries , 1990, STACS.
[11] Ronald de Wolf,et al. Exponential lower bound for 2-query locally decodable codes via a quantum argument , 2002, STOC '03.
[12] Noam Nisan,et al. Extracting Randomness: A Survey and New Constructions , 1999, J. Comput. Syst. Sci..
[13] Avi Wigderson,et al. Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications , 1993, Comb..
[14] Carsten Lund,et al. Nondeterministic exponential time has two-prover interactive protocols , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[15] David Zuckerman. Simulating BPP using a general weak random source , 2005, Algorithmica.
[16] Luca Trevisan,et al. Pseudorandom generators without the XOR Lemma , 1999, Electron. Colloquium Comput. Complex..
[17] Avi Wigderson,et al. Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing , 1997, Electron. Colloquium Comput. Complex..
[18] Noam Nisan,et al. Randomness is Linear in Space , 1996, J. Comput. Syst. Sci..
[19] Avi Wigderson,et al. Extractors and pseudo-random generators with optimal seed length , 2000, STOC '00.
[20] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[21] Amnon Ta-Shma,et al. On extracting randomness from weak random sources (extended abstract) , 1996, STOC '96.
[22] David Zuckerman. Randomness-optimal oblivious sampling , 1997, Random Struct. Algorithms.
[23] Ran Raz,et al. Error reduction for extractors , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[24] Avi Wigderson,et al. Randomness conductors and constant-degree lossless expanders , 2002, STOC '02.
[25] Amnon Ta-Shma,et al. Extractor codes , 2001, IEEE Transactions on Information Theory.
[26] Ran Raz,et al. Extracting all the randomness and reducing the error in Trevisan's extractors , 1999, STOC '99.
[27] Amnon Ta-Shma,et al. Loss-less condensers, unbalanced expanders, and extractors , 2001, STOC '01.
[28] Amnon Ta-Shma,et al. Extractors from Reed-Muller Codes , 2001, Electron. Colloquium Comput. Complex..
[29] Luca Trevisan,et al. Extractors and pseudorandom generators , 2001, JACM.
[30] Salil P. Vadhan,et al. Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model , 2003, Journal of Cryptology.
[31] Christopher Umans,et al. Simple extractors for all min-entropies and a new pseudo-random generator , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.