Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents

DOI10.1007/978-3-642-11476-2_10zbMath1274.68020OpenAlexW1523877074MaRDI QIDQ3408164

Koichi Wada, Taisuke Izumi, Shukai Cai

Publication date: 24 February 2010

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11476-2_10

Mathematics Subject Classification ID

Distributed systems (68M14) Agent technology and artificial intelligence (68T42)

Related Items (2)

Loosely-stabilizing leader election in a population protocol model ⋮ Loosely-Stabilizing Leader Election in Population Protocol Model

Cites Work

• Unnamed Item
• The computational power of population protocols
• Computation in networks of passively mobile finite-state sensors
• A Simple Population Protocol for Fast Robust Approximate Majority
• Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
• Stably computable predicates are semilinear

This page was built for publication: Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents