1. Y. Afek, E. Gafni, Distributed
2. R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, C. Rackoff, Random Walks, Universal Traversal Sequences and the Complexity of Maze Problems, Proceedings of the 20th Annual Symposium on Foundation of Computer Science, pp. 218–223, 1979.
3. K. Knight, Are Many Reactive Agents Better than a Few Deliberative Ones, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 432–437, 1993.
4. D. Hearn, M. Pauline Baker, Computer Graphics, Second Edition, Prentice Hall, 1994
5. S. Koenig, Complexity of Edge Counting, in: Goal-Directed Acting with Incomplete Information, Technical Report CMU-CS-97-199, School of Computer Science, Carnegie Mellon University, November 1997.