Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model - Search Theory: A Game Theoretic Perspective - page 210

References

1. Aho, A., Hopcroft, J., Ullman, J.: Data Structures and Algorithms. Addison Wesley (1983)
2. Alpern, S.: Rendezvous search: A personal perspective. Operations Research 50 (5), 772-795
(2002)
3. Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous, International Series in
Operations Research & Management , vol. 55. Springer (2003)
4. Baldoni, R., Bonnet, F., Milani, A., Raynal, M.: On the solvability of anonymous partial grids
exploration by mobile robots. In: Proceedings of the 12th International Conference On Prin-
ciples Of Distributed Systems (OPODIS), Lecture Notes in Computer Science , vol. 5401,
pp. 428-445. Springer-Verlag (2008)
5. Blin, L., Milani, A., Potop-Butucaru, M., Tixeuil, S.: Exclusive perpetual ring exploration
without chirality. In: Proceedings of the 24th International Symposium on Distributed Com-
puting (DISC), Lecture Notes in Computer Science , vol. 6343, pp. 312-327. Springer (2010)
6. Bonnet, F., Milani, A., Potop-Butucaru, M., Tixeuil, S.: Asynchronous exclusive perpetual grid
exploration without sense of direction. In: Proceedings of the 15th International Conference
On Principles Of Distributed Systems (OPODIS), Lecture Notes in Computer Science ,vol.
7109, pp. 251-265. Springer (2011)
7. Buss, S.: Alogtime algorithms for tree isomorphism, comparison, and canonization. In: Kurt
Gödel Colloquium, Lecture Notes in Computer Science , vol. 1289, pp. 18-33. Springer (1997)
8. Czyzowicz, J., Gasieniec, L., Pelc, A.: Gathering few fat mobile robots in the plane. Theoret-
ical Computer Science 410 (6-7), 481-499 (2009)
9. D'Angelo, G., Di Stefano, G., Navarra, A.: Gathering of six robots on anonymous symmet-
ric rings. In: Proceedings of the 18th International Colloquium on Structural Information
and Communication Complexity (SIROCCO), Lecture Notes in Computer Science , vol. 6796,
pp. 174-185 (2011)
10. D'Angelo, G., Di Stefano, G., Klasing R., Navarra A.: Gathering of robots on anonymous
grids without multiplicity detection. In: Proceedings of the 19th International Colloquium on
Structural Information and Communication Complexity (SIROCCO), Lecture Notes in Com-
puter Science , vol. 7355, pp. 327-338 (2012)
11. D'Angelo, G., Di Stefano, G., Navarra, A.: How to gather asynchronous oblivious robots
on anonymous rings. In: Proceedings of the 26th International Symposium on Distributed
Computing (DISC), Lecture Notes in Computer Science , vol. 7611, pp. 330-344 (2012)
12. Devismes, S., Petit, F., Tixeuil, S.: Optimal probabilistic ring exploration by semi-synchronous
oblivious robots. In: Proceedings of the 16th International Colloquium on Structural Informa-
tion and Communication Complexity (SIROCCO), Lecture Notes in Computer Science ,vol.
5869, pp. 195-208 (2009)

13. Flocchini, P., Ilcinkas, D., Pelc, A., Santoro, N.: Computing without communicating: Ring

exploration by asynchronous oblivious robots. Algorithmica. To appear.

14. Flocchini, P., Ilcinkas, D., Pelc, A., Santoro, N.: Remembering without memory: Tree explo-

ration by asynchronous oblivious robots. Theoretical Computer Science 411 (14-15), 1583-
1598 (2010)

15. Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with

limited visibility. Theoretical Computer Science 337 , 147-168 (2005)

16. Haba, K., Izumi, T., Katayama, Y., Inuzuka, N., Wada, K.: On gathering problem in a ring

for 2n autonomous mobile robots. In: Proceedings of the 10th International Symposium on
Stabilization, Safety, and Security of Distributed Systems (SSS), poster (2008)

17. Izumi, T., Izumi, T., Kamei, S., Ooshita, F.: Mobile robots gathering algorithm with local weak

multiplicity in rings. In: Proceedings of the 17th International Colloquium on Structural In-
formation and Communication Complexity (SIROCCO), Lecture Notes in Computer Science ,
vol. 6058, pp. 101-113 (2010)

18. Kamei, S., Lamani, A., Ooshita, F., Tixeuil, S.: Asynchronous mobile robot gathering from

symmetric configurations. In: Proceedings of the 18th International Colloquium on Struc-
tural Information and Communication Complexity (SIROCCO), Lecture Notes in Computer
Science , vol. 6796, pp. 150-161 (2011)