Explicit dispersers with polylog degree

Generating quasi-random sequences from semi-random sources

Journal of Computer and System Sciences

Independent unbiased coin flips from a correlated biased source:80a finite state Markov chain

Combinatorica

Efficiency considerations in using semi-random sources

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing

On using deterministic functions to reduce randomness in probabilistic algorithms

Information and Computation

Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources

Combinatorica - Theory of Computing

Unbiased bits from sources of weak randomness and probabilistic communication complexity

SIAM Journal on Computing - Special issue on cryptography

Expanders, randomness, or time versus space

Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986

Pseudo-random generation from one-way functions

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing

Simulating BPP using a general weak random source

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science

Implicit O(1) probe search

SIAM Journal on Computing

More deterministic simulation in logspace

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Expanders that beat the eigenvalue bound: explicit construction and applications

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Graph augmentation and related problems: theory and practice

Graph augmentation and related problems: theory and practice

Random Polynomial Time is Equal to Semi-Random Polynomial Time

Random Polynomial Time is Equal to Semi-Random Polynomial Time

Randomness, adversaries and computation (random polynomial time)

Randomness, adversaries and computation (random polynomial time)