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

Pseudo-random generation from one-way functions

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

The biased coin problem

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

Efficient learning of typical finite automata from random walks

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

Explicit dispersers with polylog degree

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

Explicit OR-dispersers with polylogarithmic degree

Journal of the ACM (JACM)

Quantum vs. classical communication and computation

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing

Extracting all the randomness and reducing the error in Trevisan's extractors

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing

Extracting all the randomness and reducing the error in Trevisan's extractors

Journal of Computer and System Sciences - STOC 1999

On the complexity of approximating the VC dimension

Journal of Computer and System Sciences - Complexity 2001

On Perfect and Adaptive Security in Exposure-Resilient Cryptography

EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology

Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Extractors with weak random seeds

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Deterministic Extractors for Affine Sources over Large Fields

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science

Deterministic extractors for small-space sources

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing

Increasing the Output Length of Zero-Error Dispersers

APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques

Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors

Journal of the ACM (JACM)

Leakage-resilient storage

SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks

Two-source extractors secure against quantum adversaries

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques

Deterministic extractors for small-space sources

Journal of Computer and System Sciences

The Sign-Rank of AC$^0$

SIAM Journal on Computing

After-the-fact leakage in public-key encryption

TCC'11 Proceedings of the 8th conference on Theory of cryptography

Generalized strong extractors and deterministic privacy amplification

IMA'05 Proceedings of the 10th international conference on Cryptography and Coding

Improving the Hadamard extractor

Theoretical Computer Science