Almost universal anonymous rendezvous in the plane
From MaRDI portal
Publication:6046947
DOI10.1007/s00453-023-01122-2arXiv2005.00880OpenAlexW3022352819MaRDI QIDQ6046947
Franck Petit, Andrzej Pelc, Yoann Dieudonné
Publication date: 6 October 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.00880
Cites Work
- Unnamed Item
- Unnamed Item
- Anonymous meeting in networks
- Self-stabilizing gathering with strong multiplicity detection
- A unified approach for gathering and exclusive searching on rings under weak assumptions
- Gathering of asynchronous robots with limited visibility
- How to meet in anonymous network
- Computing Boolean functions on anonymous networks
- The theory of search games and rendezvous.
- Universal traversal sequences with backtracking.
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Byzantine gathering in polynomial time
- Asynchronous approach in the plane: a deterministic polynomial algorithm
- Deterministic polynomial approach in the plane
- Byzantine gathering in networks
- Asynchronous deterministic rendezvous in graphs
- Deterministic rendezvous in graphs
- Yet more on the linear search problem
- Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
- Delays Induce an Exponential Memory Gap for Rendezvous in Trees
- Computing anonymously with arbitrary knowledge
- Distributed Computing by Mobile Robots: Gathering
- How to meet asynchronously (almost) everywhere
- Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Computing on an anonymous ring
- Rendezvous search on a graph
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Rendezvous search on labeled networks
- The Rendezvous Search Problem
- Gathering Despite Mischief
- Symmetry Breaking in the Plane
- How to meet asynchronously at polynomial cost
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Randomized Rendez-Vous with Limited Memory
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- The rendezvous problem on discrete locations
- LATIN 2004: Theoretical Informatics
This page was built for publication: Almost universal anonymous rendezvous in the plane
