On Extracting Randomness From Weak Random Sources

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

[2]  David Zuckerman,et al.  NP-complete problems have a version that's hard to approximate , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[3]  David Zuckerman,et al.  Simulating BPP using a general weak random source , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[4]  David Zuckerman,et al.  General weak random sources , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[5]  Nicholas Pippenger,et al.  Sorting and Selecting in Rounds , 1987, SIAM J. Comput..