Towards a strong communication complexity theory or generating quasi-random sequences from two communicating slightly-random sources

Efficiency considerations in using semi-random sources

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

Imperfect random sources and discrete controlled processes

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

Multiparty protocols and logspace-hard pseudorandom sequences

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

Lower bounds for distributed coin-flipping and randomized consensus

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

Lower bounds for distributed coin-flipping and randomized consensus

Journal of the ACM (JACM)

Pseudorandom generators without the XOR Lemma (extended abstract)

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

On the Impossibility of Private Key Cryptography with Weakly Random Keys

CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology

Extractors for a constant number of polynomially small min-entropy independent sources

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

2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction

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

Distributed computing with imperfect randomness

DISC'05 Proceedings of the 19th international conference on Distributed Computing