On pseudorandomness and resource-bounded measure

When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity

FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science

Average-case intractability vs. worst-case intractability

Information and Computation

The size of SPP

Theoretical Computer Science

Lower bounds for non-black-box zero knowledge

Journal of Computer and System Sciences - Special issue on FOCS 2003

Derandomizing Arthur-Merlin games using hitting sets

Computational Complexity

Dimension, entropy rates, and compression

Journal of Computer and System Sciences

Low-end uniform hardness vs. randomness tradeoffs for AM

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

Pseudorandomness for Approximate Counting and Sampling

Computational Complexity

Efficient learning algorithms yield circuit lower bounds

Journal of Computer and System Sciences