1. On notions of information transfer in VLSI circuits;Aho,1983
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. Exact lower bounds for computing Boolean functions on CREW PRAMs;Dietzfelbinger;J. Comput. System Sci.,1994
4. P. Ďuriš, J. Hromkovič, K. Inone, A separation of determinism, Las Vegas and nondeterminism for picture recognition, in: Proceedings of the IEEE Conference on Computational Complexity, IEEE, 2000, pp. 214–228. Full Version: Electronic Colloquium on Computational Complexity, Report no. 27, 2000.
5. P. Ďuriš, J. Hromkovič, J.D.P. Rolim, G. Schnitger, Las Vegas versus determinism for one-way communication complexity, finite automata and polynomial-time computations, in: Proceedings of the STACS‘97, Lecture Notes in Computer Science, Vol. 1200, Springer, Berlin, 1997, pp. 117–128.