Fast deterministic rendezvous in labeled lines
From MaRDI portal
Cites work
- Almost optimal asynchronous rendezvous in infinite multidimensional grids
- Anonymous meeting in networks
- Asynchronous approach in the plane: a deterministic polynomial algorithm
- Asynchronous deterministic rendezvous in graphs
- Delays induce an exponential memory gap for rendezvous in trees
- Deterministic coin tossing with applications to optimal parallel list ranking
- Deterministic rendezvous in graphs
- Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences
- Distributed computing by mobile robots: gathering
- Distributed Computing: A Locality-Sensitive Approach
- Finding Your Kids When They Are Lost
- Gathering of asynchronous robots with limited visibility
- How to meet asynchronously at polynomial cost
- How to meet in anonymous network
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Locality in Distributed Graph Algorithms
- Minimax Rendezvous on the Line
- Randomized rendezvous with limited memory
- Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
- Rendezvous search on labeled networks
- Rendezvous search when marks are left at the starting points
- Rendezvous search with markers that can be dropped at chosen times
- Search-and-rescue rendezvous
- Symmetry Breaking in the Plane
- Synchronous rendezvous for location-aware agents
- The rendezvous problem on discrete locations
- The Rendezvous Search Problem
- The theory of search games and rendezvous.
- Two Dimensional Rendezvous Search
This page was built for publication: Fast deterministic rendezvous in labeled lines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6871601)
