The agreement power of disagreement

DOI10.1016/J.TCS.2023.113772OpenAlexW4322765819MaRDI QIDQ2697537

Anissa Lamani, Sébastien Tixeuil, Quentin Bramas

Publication date: 12 April 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113772

zbMATH Keywords

rendezvousmobile robotsdistributed algorithmgatheringbivalent configuration

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Impossibility of gathering, a certification
• Gathering of asynchronous robots with limited visibility
• Autonomous mobile robots with lights
• Rendezvous of two robots with visible bits
• Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
• The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
• Distributed Computing by Mobile Robots: Gathering
• Wait-Free Gathering Without Chirality
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Stand up indulgent gathering

This page was built for publication: The agreement power of disagreement