On bounded queries and approximation. L. J. Cowen, W. Goddard, and C. E. Jesurum. Coloring with defect. 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. Oded Goldreich, Shafi Goldwasser, and Dana Ron. Property testing and its connection to learning and approximation. Oded Goldreich and Dana Ron. Property testing in bounded degree graphs.