1. M. Ajtai, J. Komlós, E. Szemeredi, Deterministic simulation in logspace, Proceedings of 19th Annual Symp. on the Theory of Computing, ACM, pp 132–140, (1987)
2. N. Alon, U. Feige, A. Wigderson, D. Zuckerman, Derandomized graph products, Computational Complexity (1995) pp. 60–75.
3. N. Alon, E. Fischer and M. Krivelevich, M. Szegedy “Logical Property Testing”, FOCS 1999
4. N. Alon, M. Krivelevich, I. Newman, M. Szegedy “Regularity Testing”, FOCS 1999
5. S. Arora, Probabilistic Checking of Proofs and Hardness of Approximation Problems, PhD thesis, U.C. Berkeley, 1994. Available from http://www.cs.princeton.edu/~arora.