The cost of probabilistic agreement in oblivious robot networks

DOI10.1016/j.ipl.2010.04.006zbMath1229.68006OpenAlexW2113586464MaRDI QIDQ656601

Taisuke Izumi, Maria Gradinariu Potop-Butucaru, Xavier Défago, Stephane Messika, Julien Clément

Publication date: 18 January 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.04.006

zbMATH Keywords

distributed systemsanalysis of algorithmsdesign of algorithmsdistributed computingrandomized algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Distributed systems (68M14) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (5)

On time complexity for connectivity-preserving scattering of mobile robots ⋮ Self-stabilizing gathering with strong multiplicity detection ⋮ Computing on rings by oblivious robots: a unified approach for different tasks ⋮ On the self-stabilization of mobile oblivious robots in uniform rings ⋮ The Random Bit Complexity of Mobile Robots Scattering

Cites Work

• Unnamed Item
• Hybrid I/O automata.
• Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Markov Chains
• Robots and Demons (The Code of the Origins)

This page was built for publication: The cost of probabilistic agreement in oblivious robot networks