1. M. Ajtai, J. Komlós, E. Szemeredi, Deterministic simulation in logspace, Proceedings of 19th Annual Symp. on the Theory of Computing, ACM, 1987, pp. 132–140
2. C. Ambühl, M. Mastrolilli, O. Svensson, Inapproximability results for sparsest cut, optimal linear arrangement, and precedence constrained scheduling, in FOCS, 2007, pp. 329–337
3. N. Alon, U. Feige, A. Wigderson, D. Zuckerman, Derandomized graph products. Comput. Complex. 60–75 (1995)
4. S. Arora, C, Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and the intractability of approximation problems. J. ACM 45(3), 501–555 (1998). Preliminary version in Proc. of FOCS’92
5. S. Arora, S. Safra, Probabilistic checking of proofs: a new characterization of NP. J. ACM 45(1), 70–122 (1998). Preliminary version in Proc. of FOCS’92