Token management schemes and random walks yield self-stabilizing mutual exclusion
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Rendezvous Search on the Line With Distinguishable Players
SIAM Journal on Control and Optimization
SIAM Journal on Control and Optimization
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
Asymmetric rendezvous on the plane
Proceedings of the fourteenth annual symposium on Computational geometry
SIAM Journal on Control and Optimization
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
Operations Research
Two Dimensional Rendezvous Search
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
Improved bounds for the symmetric rendezvous value on the line
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Polynomial deterministic rendezvous in arbitrary graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
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
Asynchronous deterministic rendezvous in bounded terrains
Theoretical Computer Science
DISC 2011 invited lecture: deterministic rendezvous in networks: survey of models and results
DISC'11 Proceedings of the 25th international conference on Distributed computing
Asynchronous deterministic rendezvous in bounded terrains
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
How to meet asynchronously (almost) everywhere
ACM Transactions on Algorithms (TALG)
Hi-index | 0.00 |
We study the rendezvous problem in the asynchronous setting in the graph of infinite line following the model introduced in [13]. We formulate general lemmas about deterministic rendezvous algorithms in this setting which characterize the algorithms in which the agents have the shortest routes. We also improve rendezvous algorithms in the infinite line which formulated in [13]. Two agents have distinct labels L m in ,L m ax and |L m in |leq |L m ax |. When the initial distance D between the agents is known, our algorithm has cost $D |L_min|^2$ which is an improvement in the constant. If the initial distance is unknown we give an algorithm of cost $O(D\log^2 D+D log D|L_max |+D|L_min |^2+|L_max ||L_min |log|L_min |)$ which is an asymptotic improvement.