1. A. Aggarwal, D. Coppersmith, D. Kleitman (1989): A generalized model for understanding evasiveness, Inf. Proc. Lett.30, 205–208.
2. L. Babai, P. Frankl, J. Simon (1986): Complexity classes in communication complexity, 27.FOCS, 337–347.
3. L. Babai, N. Nisan, M. Szegedy (1989): Multiparty protocols and logspace hard pseudorandom sequences, 21.STOC, 1–11.
4. D. A. Barrington (1989): Bounded-width polynomial size branching programs recognize exactly those languages in NC1, JCSS38, 150–164.
5. B. Bollobás (1984): Extremal Graph Theory, Academic Press.