Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Universal traversal sequences with backtracking
Journal of Computer and System Sciences - Complexity 2001
Mobile Search for a Black Hole in an Anonymous Ring
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Agent Rendezvous: A Dynamic Symmetry-Breaking Problem
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Gathering of Asynchronous Oblivious Robots with Limited Visibility
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Rendezvous Search: A Personal Perspective
Operations Research
Mobile Agent Rendezvous in a Ring
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Asynchronous deterministic rendezvous in graphs
Theoretical Computer Science
Oracle size: a new measure of difficulty for communication tasks
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Networks
Deterministic Rendezvous in Graphs
Algorithmica
Local MST computation with short advice
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Impossibility of gathering by a set of autonomous mobile robots
Theoretical Computer Science
Gathering asynchronous oblivious mobile robots in a ring
Theoretical Computer Science
How to meet in anonymous network
Theoretical Computer Science
Undirected connectivity in log-space
Journal of the ACM (JACM)
Deterministic Rendezvous in Trees with Little Memory
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
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
Asynchronous Deterministic Rendezvous on the Line
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
The power of tokens: rendezvous and symmetry detection for two mobile agents in a ring
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Delays induce an exponential memory gap for rendezvous in trees
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
How to meet when you forget: log-space rendezvous in arbitrary graphs
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The Mobile Agent Rendezvous Problem in the Ring
The Mobile Agent Rendezvous Problem in the Ring
How to meet asynchronously (almost) everywhere
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Tell me where i am so i can meet you sooner: asynchronous rendezvous with location information
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Almost optimal asynchronous rendezvous in infinite multidimensional grids
DISC'10 Proceedings of the 24th international conference on Distributed computing
Mobile agent rendezvous: a survey
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Optimal memory rendezvous of anonymous mobile agents in a unidirectional ring
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
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
How to meet asynchronously at polynomial cost
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Deterministic polynomial approach in the plane
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Price of asynchrony in mobile agents computing
Theoretical Computer Science
| Hi-index | 0.00 |
Two or more mobile entities, called agents or robots, starting at distinct initial positions, have to meet. This task is known in the literature as rendezvous. Among many alternative assumptions that have been used to study the rendezvous problem, two most significantly influence the methodology appropriate for its solution. The first of these assumptions concerns the environment in which the mobile entities navigate: it can be either a terrain in the plane, or a network modeled as an undirected graph. The second assumption concerns the way in which the entities move: it can be either deterministic or randomized. In this article, we survey results on deterministic rendezvous in networks. © 2012 Wiley Periodicals, Inc. NETWORKS, 2012 © 2012 Wiley Periodicals, Inc.