How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
From MaRDI portal
Publication:692907
DOI10.1007/S00224-011-9313-ZzbMATH Open1281.68049OpenAlexW2092232879MaRDI QIDQ692907FDOQ692907
Authors: Shukai Cai, Taisuke Izumi, Koichi Wada 
Publication date: 6 December 2012
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-011-9313-z
Recommendations
Cites Work
- Computation in networks of passively mobile finite-state sensors
- The computational power of population protocols
- Title not available (Why is that?)
- Stably computable predicates are semilinear
- Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
- A Simple Population Protocol for Fast Robust Approximate Majority
Cited In (20)
- Constructing self-stabilizing oscillators in population protocols
- Fault-tolerant simulation of population protocols
- The Power of Global Knowledge on Self-stabilizing Population Protocols
- Brief announcement: Space-optimal naming in population protocols
- Constant-space population protocols for uniform bipartition
- On the power of oracle \(\varOmega ?\) for self-stabilizing leader election in population protocols
- A combinatorial characterization of self-stabilizing population protocols
- Loosely-stabilizing leader election with polylogarithmic convergence time
- Title not available (Why is that?)
- Mediated population protocols: leader election and applications
- Space-efficient self-stabilizing counting population protocols on mobile sensor networks
- A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States
- Brief Announcement: Population Protocols Decide Double-exponential Thresholds
- Space complexity of self-stabilizing leader election in passively-mobile anonymous agents
- On space complexity of self-stabilizing leader election in mediated population protocol
- Constructing Self-stabilizing Oscillators in Population Protocols
- On space and time complexity of loosely-stabilizing leader election
- Title not available (Why is that?)
- A Combinatorial Characterization of Self-stabilizing Population Protocols
- Self-stabilizing systems in spite of high dynamics
This page was built for publication: How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q692907)
