1. N. Alon, Explicit Ramsey graphs and orthonormal labelings,The Electronic Journal of Combinatorics 1 (1994) R12.
2. N. Alon and Y. Peres, Euclidean Ramsey theory and a construction of Bourgain,Acta Mathematica Hungarica 57 (1991) 61–64.
3. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof verification and intractability of approximation problems, in:Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science (IEEE Computer Society Press, Los Alamitos, CA, 1992) 14–23.
4. S. Arora and S. Safra, Probabilistic checking of proofs; a new characterization of NP, in:Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science (IEEE Computer Society Press, Los Alamitos, CA, 1992) 2–13.
5. B. Berger and J. Rompel, A better performance guarantee for approximate graph coloring,Algorithmica 5 (1990) 459–466.