scientific article; zbMATH DE number 7376074
From MaRDI portal
Publication:5002836
DOI10.4230/LIPIcs.ICALP.2018.147zbMath1499.68032arXiv1801.07656MaRDI QIDQ5002836
Anissa Lamani, Yoann Dieudonné, Sébastien Bouchard
Publication date: 28 July 2021
Full work available at URL: https://arxiv.org/abs/1801.07656
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (2)
Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots ⋮ Byzantine gathering in polynomial time
Cites Work
- Unnamed Item
- Unnamed Item
- Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
- Fast rendezvous with advice
- How to meet in anonymous network
- Tree exploration with advice
- Graph searching with advice
- The theory of search games and rendezvous.
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Byzantine gathering in networks
- Asynchronous deterministic rendezvous in graphs
- Distributed computing with advice: information sensitivity of graph coloring
- Deterministic rendezvous in graphs
- Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
- The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
- Delays Induce an Exponential Memory Gap for Rendezvous in Trees
- Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs
- Distributed Computing by Mobile Robots: Gathering
- How to meet asynchronously (almost) everywhere
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- Deterministic Rendezvous in Trees with Little Memory
- Approximate distance oracles
- Tell Me Where I Am So I Can Meet You Sooner
- Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
- Undirected connectivity in log-space
- Rendezvous Search: A Personal Perspective
- Reaching Agreement in the Presence of Faults
- Search on a Line by Byzantine Robots
- Labeling Schemes for Flow and Connectivity
- Gathering Despite Mischief
- Label-guided graph exploration by a finite automaton
- How to meet asynchronously at polynomial cost
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs
- Time versus cost tradeoffs for deterministic rendezvous in networks
This page was built for publication:
