Rendezvous Search on the Line

Authors:
Arthur Hsu;Yehuda Bassok;Nicolas P. B. Bollen;Liqun Qi;Scott Webster;J. V. Howard;Shmuel Gal
Affiliations:
-;-;-;-;-;-;-
Venue:
Operations Research
Year:
1999

Citing 0
Cited 24

Asymmetric rendezvous on the plane

Proceedings of the fourteenth annual symposium on Computational geometry
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
How to meet in anonymous network

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
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
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
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
Synchronous rendezvous for location-aware agents

DISC'11 Proceedings of the 25th international conference on Distributed computing
Gathering despite mischief

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
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
Asynchronous deterministic rendezvous in bounded terrains

SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
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
Delays Induce an Exponential Memory Gap for Rendezvous in Trees

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present two new results for the asymmetric rendezvous problem on the line. We first show that it is never optimal for one player to be stationary during the entire search period in the two-player rendezvous. Then we consider the meeting time of n-players in the worst case and show that it has an asymptotic behavior of n = 2 + O(log n).