Asynchronous Deterministic Rendezvous on the Line

DOI10.1007/978-3-540-95891-8_45zbMath1206.68242OpenAlexW1607495182MaRDI QIDQ3599098

Grzegorz Stachowiak

Publication date: 3 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.384.330

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

On asynchronous rendezvous in general graphs ⋮ Rendezvous Problem ⋮ Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains ⋮ Asynchronous deterministic rendezvous in bounded terrains ⋮ Linear rendezvous with asymmetric clocks ⋮ Rendezvous in planar environments with obstacles and unknown initial distance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The theory of search games and rendezvous.
• Asynchronous deterministic rendezvous in graphs
• Two Dimensional Rendezvous Search
• Finding Your Kids When They Are Lost
• Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
• Note: Two rendezvous search problems on the line
• Rendezvous search on a graph
• Rendezvous search when marks are left at the starting points
• Rendezvous search on labeled networks
• Rendezvous Search on the Line
• Minimax Rendezvous on the Line
• The Rendezvous Search Problem
• Rendezvous Search on the Line with Distinguishable Players
• Rendezvous Search on the Line with Indistinguishable Players
• Algorithms and Computation
• The rendezvous problem on discrete locations
• Algorithms - ESA 2003
• LATIN 2004: Theoretical Informatics

This page was built for publication: Asynchronous Deterministic Rendezvous on the Line