Deterministic rendezvous in infinite trees
From MaRDI portal
Publication:6140349
DOI10.1016/j.tcs.2023.114313arXiv2203.05160MaRDI QIDQ6140349
Publication date: 2 January 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.05160
Cites Work
- Anonymous meeting in networks
- Gathering of asynchronous robots with limited visibility
- How to meet in anonymous network
- Operations research/management science at work.
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Asynchronous approach in the plane: a deterministic polynomial algorithm
- Asynchronous deterministic rendezvous in graphs
- Deterministic rendezvous in graphs
- Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
- Delays Induce an Exponential Memory Gap for Rendezvous in Trees
- Synchronous Rendezvous for Location-Aware Agents
- Distributed Computing by Mobile Robots: Gathering
- Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
- Two Dimensional Rendezvous Search
- Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
- Rendezvous search when marks are left at the starting points
- Minimax Rendezvous on the Line
- The Rendezvous Search Problem
- Symmetry Breaking in the Plane
- How to meet asynchronously at polynomial cost
- Randomized Rendez-Vous with Limited Memory
- LATIN 2004: Theoretical Informatics
This page was built for publication: Deterministic rendezvous in infinite trees
