On the design of reliable Boolean circuits that contain partially unreliable gates

Kleitman and combinatorics: a celebration

Discrete Mathematics - Kleitman and combinatorics: a celebration

Rounds vs queries trade-off in noisy computation

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms

Lower Bounds for the Noisy Broadcast Problem

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

Making polynomials robust to noise

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing