Electing a leader in a synchronous ring
Journal of the ACM (JACM)
Rendezvous Search on the Line with Indistinguishable Players
SIAM Journal on Control and Optimization
SIAM Journal on Control and Optimization
Asymmetric rendezvous search on the circle
Dynamics and Control
Alternating search at two locations
Dynamics and Control
Two Dimensional Rendezvous Search
Operations Research
Rendezvous Search: A Personal Perspective
Operations Research
Sense of direction in distributed computing
Theoretical Computer Science - Special issue: Distributed computing
Mobile agent rendezvous in the ring
Mobile agent rendezvous in the ring
Move-optimal gossiping among mobile agents
Theoretical Computer Science
Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Mobile agent rendezvous in a ring using faulty tokens
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Randomized rendez-vous with limited memory
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
Theoretical Computer Science
Uniform multi-agent deployment on a ring
Theoretical Computer Science
Deterministic symmetric rendezvous with tokens in a synchronous torus
Discrete Applied Mathematics
Randomized rendezvous with limited memory
ACM Transactions on Algorithms (TALG)
Mobile agent rendezvous: a survey
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Space-optimal rendezvous of mobile agents in asynchronous trees
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Mobile robots gathering algorithm with local weak multiplicity in rings
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Mobile agent rendezvous in a synchronous torus
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Rendezvous of mobile agents in unknown graphs with faulty links
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Linear time and space gathering of anonymous mobile agents in asynchronous trees
Theoretical Computer Science
Hi-index | 0.00 |
We study the rendezvous problem with k≥2 mobile agents in a n-node ring. We present a new algorithm which solves the rendezvous problem for any non-periodic distribution of agents on the ring. The mobile agents require the use of O(log k)–bit-wise size of internal memory and one indistinguishable token each. In the periodic (but not symmetric) case our new procedure allows the agents to conclude that rendezvous is not feasible. It is known that in the symmetric case the agents cannot decide the feasibility of rendezvous if their internal memory is limited to ω(loglog n) bits, see [15]. In this context we show new space optimal deterministic algorithm allowing effective recognition of the symmetric case. The algorithm is based on O(log k + loglog n)-bit internal memory and a single token provided to each mobile agent. Finally, it is known that both in the periodic as well as in the symmetric cases the rendezvous cannot be accomplished by any deterministic procedure due to problems with breaking symmetry.