Rendezvous Search on the Line with Indistinguishable Players
SIAM Journal on Control and Optimization
Minimax Rendezvous on the Line
SIAM Journal on Control and Optimization
SIAM Journal on Control and Optimization
Asymmetric rendezvous search on the circle
Dynamics and Control
Agent Rendezvous: A Dynamic Symmetry-Breaking Problem
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Rendezvous Search on the Interval and the Circle
Operations Research
Two Dimensional Rendezvous Search
Operations Research
Sense of direction in distributed computing
Theoretical Computer Science - Special issue: Distributed computing
Asynchronous deterministic rendezvous in graphs
Theoretical Computer Science
Map construction of unknown graphs by multiple agents
Theoretical Computer Science
Gathering asynchronous oblivious mobile robots in a ring
Theoretical Computer Science
Move-optimal gossiping among mobile agents
Theoretical Computer Science
How to meet in anonymous network
Theoretical Computer Science
Election and rendezvous with incomparable labels
Theoretical Computer Science
Deterministic Rendezvous in Trees with Little Memory
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Asynchronous Deterministic Rendezvous on the Line
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Optimal moves for gossiping among mobile agents
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Mobile agent rendezvous in a ring using faulty tokens
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
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
Randomized rendez-vous with limited memory
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
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
How to meet asynchronously (almost) everywhere
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Almost optimal asynchronous rendezvous in infinite multidimensional grids
DISC'10 Proceedings of the 24th international conference on Distributed computing
Constructing a map of an anonymous graph: applications of universal sequences
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Deterministic symmetric rendezvous with tokens in a synchronous torus
Discrete Applied Mathematics
Randomized rendezvous with limited memory
ACM Transactions on Algorithms (TALG)
Asynchronous deterministic rendezvous in bounded terrains
Theoretical Computer Science
Distributed security algorithms by mobile agents
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Improved distributed exploration of anonymous networks
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Mobile agent rendezvous: a survey
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
How to meet in anonymous network
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Asynchronous deterministic rendezvous in graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Polynomial deterministic rendezvous in arbitrary graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Distributed exploration of an unknown graph
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Asynchronous deterministic rendezvous in bounded terrains
SIROCCO'10 Proceedings of the 17th 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
Asynchronous rendezvous of anonymous agents in arbitrary graphs
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Time vs. space trade-offs for rendezvous in trees
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
How to meet asynchronously (almost) everywhere
ACM Transactions on Algorithms (TALG)
Time of anonymous rendezvous in trees: determinism vs. randomization
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Brief announcement: mobile agent rendezvous on edge evolving rings
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Delays Induce an Exponential Memory Gap for Rendezvous in Trees
ACM Transactions on Algorithms (TALG)
Linear time and space gathering of anonymous mobile agents in asynchronous trees
Theoretical Computer Science
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.01 |
In the rendezvous search problem, two mobile agentsmust move along the n nodes of a network so as to minimizethe time required to meet or rendezvous. When themobile agents are identical and the network is anonymous,however, the resulting symmetry can make the problem impossibleto solve. Symmetry is typically broken by havingthe mobile agents run either a randomized algorithm or differentdeterministic algorithms. We investigate the use ofidentical tokens to break symmetry so that the two mobileagents can run the same deterministic algorithm. After derivingthe explicit conditions under which identical tokenscanbeused to breaksymmetry onthen node ring, we derivethe lower and upper bounds for the time and memory complexityof the rendezvous search problem with various parametersets. While these results suggest a possible tradeoffbetween the mobile agents' memory and the time complexityof the rendezvous search problem, we prove that this trade-offis limited.