Byzantine gathering in networks
From MaRDI portal
Publication:2359766
DOI10.1007/s00446-016-0276-9zbMath1412.68021arXiv1504.01623OpenAlexW2570440769MaRDI QIDQ2359766
Sébastien Bouchard, Yoann Dieudonné, Bertrand Ducourthial
Publication date: 22 June 2017
Published in: Distributed Computing, Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.01623
Network design and communication in computer systems (68M10) 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 (9)
Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots ⋮ Byzantine gathering in polynomial time ⋮ Almost universal anonymous rendezvous in the plane ⋮ Unnamed Item ⋮ Byzantine Gathering in Networks with Authenticated Whiteboards ⋮ The topology of look-compute-move robot wait-free algorithms with hard termination ⋮ Gathering in dynamic rings ⋮ Gathering anonymous, oblivious robots on a grid ⋮ Asynchronous approach in the plane: a deterministic polynomial algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Anonymous meeting in networks
- Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
- Fast rendezvous with advice
- How to meet in anonymous network
- The theory of search games and rendezvous.
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Asynchronous deterministic rendezvous in graphs
- 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
- 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
- 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
- Gathering Despite Mischief
- How to meet asynchronously at polynomial cost
- Discovering the Semantics of Relational Tables Through Mappings
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs
This page was built for publication: Byzantine gathering in networks
