Random debaters and the hardness of approximating stochastic functions. Anne Condon and Richard Ladner. Interactive proof systems with polynomially bounded strategies. Interactive proofs and the hardness of approximating cliques. Uriel Feige and Joe Kilian.
Impossibility results for recycling random bits in two-prover proof systems.
Uriel Feige and Joe Kilian. Zero knowledge and the chromatic number. Oded Goldreich, Shafi Goldwasser, and Dana Ron. Property testing and its connection to learning and approximation. Oded Goldreich and Dana Ron.