Fast rendezvous with advice
From MaRDI portal
Publication:896137
DOI10.1016/j.tcs.2015.09.025zbMath1333.68068arXiv1407.1428MaRDI QIDQ896137
Publication date: 11 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.1428
68R10: Graph theory (including graph drawing) in computer science
68M14: Distributed systems
68W15: Distributed algorithms
68T42: Agent technology and artificial intelligence
Related Items
Unnamed Item, Asynchronous approach in the plane: a deterministic polynomial algorithm, Byzantine gathering in networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Drawing maps with advice
- Online computation with advice
- Trade-offs between the size of advice and broadcasting time in trees
- Gathering of asynchronous robots with limited visibility
- Local MST computation with short advice
- Tree exploration with advice
- Fast radio broadcasting with advice
- Communication algorithms with advice
- Graph searching with advice
- Volume of an N-simplex by multiple integration
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Asynchronous deterministic rendezvous in graphs
- Proof labeling schemes
- Distributed computing with advice: information sensitivity of graph coloring
- Deterministic rendezvous in graphs
- Delays Induce an Exponential Memory Gap for Rendezvous in Trees
- Distributed Computing by Mobile Robots: Gathering
- How to meet asynchronously (almost) everywhere
- Approximate distance oracles
- Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
- How to Meet in Anonymous Network
- 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
- Rendezvous search when marks are left at the starting points
- Rendezvous search on labeled networks
- Labeling Schemes for Flow and Connectivity
- Minimax Rendezvous on the Line
- Distance labeling in graphs
- The Rendezvous Search Problem
- Label-guided graph exploration by a finite automaton
- How to meet asynchronously at polynomial cost
- Randomized Rendez-Vous with Limited Memory
- The rendezvous problem on discrete locations
- LATIN 2004: Theoretical Informatics
