Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th Symposium on Theory of Computing, STOC 1980, pp. 82–93 (1980)
2. Awerbuch, B., Betke, M., Rivest, R., Singh, M.: Piecemeal graph exploration by a mobile robot (extended abstract). In: Proc. of the 8th annual conference on Computational Learning Theory, COLT 1995, pp. 321–328. ACM Press, New York (1995)
3. Barrière, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Can we elect if we cannot compare? In: Proc. of the 15th annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2003, pp. 324–332. ACM Press, New York (2003)
4. Barrière, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Rendezvous and election of mobile agents: Impact of sense of direction. In: Theory of Computing Systems (to appear)
5. Bender, M., Slonim, D.: The power of team exploration: Two robots can learn unlabeled directed graphs. In: Proc. of the 35th annual Symposium on Foundations of Computer Science, FOCS 1994, pp. 75–85 (1994)