Extracting all the Randomness and Reducing the Error in Trevisan's Extractors

This publication has 39 references indexed in Scilit:

• Extractors and pseudo-random generators with optimal seed length
  Published by Association for Computing Machinery (ACM) ,2000
• Learning Polynomials with Queries: The Highly Noisy Case
  SIAM Journal on Discrete Mathematics, 2000
• Free Bits, PCPs, and Nonapproximability---Towards Tight Results
  SIAM Journal on Computing, 1998
• Tiny families of functions with random properties: A quality-size trade-off for hashing
  Random Structures & Algorithms, 1997
• P = BPP if E requires exponential circuits
  Published by Association for Computing Machinery (ACM) ,1997
• Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs
  Published by Springer Nature ,1997
• Pseudo-random generation from one-way functions
  Published by Association for Computing Machinery (ACM) ,1989
• Dispersers, deterministic amplification, and weak random sources
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
  SIAM Journal on Computing, 1988
• Families of finite sets in which no set is covered by the union ofr others
  Israel Journal of Mathematics, 1985