Deterministic Rendezvous with Detection Using Beeps
From MaRDI portal
DOI10.1007/978-3-319-28472-9_7zbMath1359.68016arXiv1709.06214OpenAlexW2398465054MaRDI QIDQ5890529
Publication date: 10 March 2016
Published in: International Journal of Foundations of Computer Science, Algorithms for Sensor Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.06214
algorithmalgorithmsgraphdeterministicrendezvousdetectionsynchronoussynchronous networkdeterministic rendezvousbeep
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)
Related Items (1)
Cites Work
- Gathering of asynchronous robots with limited visibility
- Universal traversal sequences with backtracking.
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Deterministic rendezvous in graphs
- Delays Induce an Exponential Memory Gap for Rendezvous in Trees
- Distributed Computing by Mobile Robots: Gathering
- Two Dimensional Rendezvous Search
- How to meet asynchronously at polynomial cost
This page was built for publication: Deterministic Rendezvous with Detection Using Beeps
