-
Fault and Byzantine Tolerant Self-stabilizing Mobile Robots Gathering
This work is under review in Distributed Computing Journal -
How to gather asynchronous oblivious robots on anonymous rings
A set of robots arbitrarily placed on the nodes of an anonymous graph have to meet at one common node and remain in there. This problem is known in the literature as...
