Self-stabilizing gathering with strong multiplicity detection
From MaRDI portal
Publication:418745
DOI10.1016/J.TCS.2011.12.010zbMATH Open1238.68039OpenAlexW2052126600MaRDI QIDQ418745FDOQ418745
Authors: Yoann Dieudonné, Franck Petit 
Publication date: 30 May 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.010
Recommendations
Cites Work
- Gathering asynchronous oblivious mobile robots in a ring
- Self-stabilizing systems in spite of distributed control
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Title not available (Why is that?)
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Gathering of asynchronous robots with limited visibility
- LATIN 2004: Theoretical Informatics
- Impossibility of gathering by a set of autonomous mobile robots
- LATIN 2004: Theoretical Informatics
- Mobile robots gathering algorithm with local weak multiplicity in rings
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- Convex hulls of finite sets of points in two and three dimensions
- Self-stabilizing gathering with strong multiplicity detection
- The cost of probabilistic agreement in oblivious robot networks
Cited In (16)
- On the self-stabilization of mobile oblivious robots in uniform rings
- Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights
- Self-stabilizing gathering with strong multiplicity detection
- Almost universal anonymous rendezvous in the plane
- Rendezvous with constant memory
- Rendezvous of two robots with constant memory
- Wait-free gathering without chirality
- Explicit communication among stigmergic robots
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
- Title not available (Why is that?)
- Gathering problems for autonomous mobile robots with lights
- Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights
- Rendezvous of Asynchronous Mobile Robots with Lights
- Meeting in a polygon by anonymous oblivious robots
- Self-stabilizing gathering of mobile robots under crash or Byzantine faults
- Asynchronous approach in the plane: a deterministic polynomial algorithm
This page was built for publication: Self-stabilizing gathering with strong multiplicity detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418745)
