1. A.V. Aho, J.E. Hopcroft, M. Yannakakis, On notions of information transfer in VLSI circuits, Proc. 15th Ann. ACM STOC, ACM, 1983, pp. 133–139.
2. L. Babai, Monte Carlo algorithms in graph isomorphism techniques, Research Report No. 79-10, Département de mathématiques et statistique, Université de Montréal, 1979.
3. A note on sweeping automata;Berman,1980
4. Exact lower bounds for computing Boolean functions on CREW PRAMs;Dietzelfelbinger;J. Comput. System Sci.,1994
5. P. Ďuris̆, J. Hromkovič, J.D.P. Rolim, G. Schnitger, Las Vegas versus determinism for one-way communication complexity, finite automata and polynomial-time computations, in: Proc. STACS ’97, Lecture Notes in Computer Science, vol. 1200, Springer, Berlin, 1997, pp. 117–128.