Self-stabilizing population protocols

No abstract is available for this paper.

• Publication year

  2005

• Venue

  TAAS

• Publication date

  2005-12-12

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/1452001.1452003
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The computational power of population protocols

  2006cited by this paper
• Stably Computable Properties of Network Graphs

  2005cited by this paper
• Labeling graphs with a condition at distance two

  2005cited by this paper
• Coloring unstructured radio networks

  2005cited by this paper
• Bounded service time and memory space optimal self-stabilizing token circulation protocol on unidirectional rings

  2004cited by this paper
• A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks

  2004cited by this paper
• Computation in networks of passively mobile finite-state sensors

  2004cited by this paper
• Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler

  2001cited by this paper
• Memory space requirements for self-stabilizing leader election protocols

  1999influential reference
• SelfStabilizing Token Circulation on Anonymous Message Passing

  1998cited by this paper
• Self-Stabilizing Token Circulation on Anonymous Message Passing Rings (Extended Abstract)

  1998cited by this paper
• Uniform Dynamic Self-Stabilizing Leader Election

  1997cited by this paper
• The Stabilizing Token Ring in Three Bits

  1996cited by this paper
• Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings

  1995cited by this paper
• Fast and lean self-stabilizing asynchronous protocols

  1994cited by this paper
• Self-stabilizing symmetry breaking in constant-space (extended abstract)

  1992cited by this paper
• Labelling Graphs with a Condition at Distance 2

  1992cited by this paper
• Probabilistic Self-Stabilization

  1990cited by this paper
• Achievable cases in an asynchronous environment

  1987cited by this paper
• Self-stabilizing systems in spite of distributed control

  1974cited by this paper

• Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs

  2026cites this paper
• Near-optimal population protocols on bounded-degree trees

  2026influential citation
• Modeling and stability analysis of live systems with time-varying dimension

  2025cites this paper
• Improving Efficiency in Near-State and State-Optimal Self-Stabilising Leader Election Population Protocols

  2025cites this paper
• Complementary Time-Space Tradeoff for Self-Stabilizing Leader Election: Polynomial States Meet Sublinear Time

  2025cites this paper
• Complete Graph Identification in Population Protocols

  2024cites this paper
• Sublinear-time Collision Detection with a Polynomial Number of States in Population Protocols

  2024cites this paper
• Almost Time-Optimal Loosely-Stabilizing Leader Election on Arbitrary Graphs Without Identifiers in Population Protocols

  2024cites this paper
• On the Simulation Power of Surface Chemical Reaction Networks

  2024cites this paper
• A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States

  2023cites this paper
• Early Adapting to Trends: Self-Stabilizing Information Spread using Passive Communication

  2022cites this paper
• Origin of Self-Stabilization

  2022cites this paper
• Near-Optimal Leader Election in Population Protocols on Graphs

  2022cites this paper
• Breaking Through the Ω(n)-Space Barrier: Population Protocols Decide Double-Exponential Thresholds

  2022cites this paper
• Dynamic size counting in population protocols

  2022cites this paper
• Implementation and Evaluation of Leader Election in the Population Protocol Model Using an Emulation Environment

  2022cites this paper
• Protocols with constant local storage and unreliable communication

  2022cites this paper
• Uniform bipartition in the population protocol model with arbitrary graphs

  2021cites this paper
• Self-Stabilizing Population Protocols With Global Knowledge

  2021influential citation
• Fast Graphical Population Protocols

  2021cites this paper
• Smoothed Analysis of Population Protocols

  2021cites this paper
• Self-Stabilizing Clock Synchronization with 1-bit Messages

  2021cites this paper
• Modular population protocols

  2021cites this paper
• Population Protocols for Graph Class Identification Problems

  2021cites this paper
• Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs

  2020cites this paper
• Loosely-Stabilizing Leader Election with Polylogarithmic Convergence Time

  2020cites this paper
• Robust Comparison in Population Protocols

  2020cites this paper
• Institutional Knowledge at Singapore Management University Institutional Knowledge at Singapore Management University Verification of population ring protocols in PAT Verification of population ring protocols in PAT

  2020cites this paper
• Modelling Gossip Interactions in Open Multi-Agent Systems

  2020cites this paper
• Stabilization, Safety, and Security of Distributed Systems: 22nd International Symposium, SSS 2020, Austin, TX, USA, November 18–21, 2020, Proceedings

  2020cites this paper
• A Combinatorial Characterization of Self-Stabilizing Population Protocols

  2020influential citation
• Time-Optimal Self-Stabilizing Leader Election on Rings in Population Protocols

  2020cites this paper
• Open Multi-Agent Systems with Variable Size: the Case of Gossiping

  2020cites this paper
• Self-Stabilizing Leader Election in Regular Graphs

  2020cites this paper
• Structural Information and Communication Complexity: 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29–July 1, 2020, Proceedings

  2020cites this paper
• Time-optimal Loosely-stabilizing Leader Election in Population Protocols

  2020cites this paper
• Distributed Computing Theory for Molecular Robot Systems

  2020cites this paper
• Consensus Dynamics

  2020cites this paper
• The Power of Global Knowledge on Self-stabilizing Population Protocols

  2020influential citation
• Comparison Dynamics in Population Protocols

  2020cites this paper
• Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols Without Identifiers nor Random Numbers

  2020cites this paper
• Distributed Computing Column 77 Consensus Dynamics

  2020cites this paper
• PopSGD: Decentralized Stochastic Gradient Descent in the Population Model

  2019cites this paper
• Immediate Observation in Mediated Population Protocols

  2019cites this paper
• Fault Tolerant Network Constructors

  2019cites this paper
• Space-Optimal Naming in Population Protocols

  2019cites this paper
• Byzantine-Tolerant Register in a System with Continuous Churn

  2019cites this paper
• Loosely-Stabilizing Leader Election for Arbitrary Graphs in Population Protocol Model

  2019influential citation
• Population protocols with unreliable communication

  2019cites this paper
• Uniform Partition in Population Protocol Model under Weak Fairness

  2019cites this paper
• Time-Optimal Self-Stabilizing Leader Election in Population Protocols

  2019cites this paper
• Broadcast Distributed Voting Algorithm in Population Protocols

  2019cites this paper
• Self-Stabilizing Leader Election

  2019cites this paper
• Space-Optimal Population Protocols for Uniform Bipartition Under Global Fairness

  2019cites this paper
• Population Stability: Regulating Size in the Presence of an Adversary

  2018cites this paper
• Search and broadcast in stochastic environments, a biological perspective. (Recherche et diffusion d'informations dans un environnement bruité, une perspective biologique)

  2018cites this paper
• A Population Protocol for Uniform k-Partition Under Global Fairness

  2018cites this paper
• 30 : 2 Loosely-Stabilizing Leader Election with Polylogarithmic Convergence Time 1

  2018cites this paper
• A Survey on Analog Models of Computation

  2018cites this paper
• Recent Algorithmic Advances in Population Protocols

  2018cites this paper
• Mediated Population Protocols: Leader Election and Applications

  2017cites this paper
• Deterministic Population Protocols for Exact Majority and Plurality

  2017cites this paper
• Towards an integrated formal method for verification of liveness properties in distributed systems: with application to population protocols

  2017cites this paper
• Majority problems in distributed systems and clustering in structured graphs

  2017cites this paper
• Computing models for networks of tiny objects

  2017cites this paper
• A Tool for Verification and Simulation of Population Protocols

  2017cites this paper
• Limits for Rumor Spreading in stochastic populations

  2017cites this paper
• Constant-Space Population Protocols for Uniform Bipartition

  2017cites this paper
• Classification-Based Parameter Synthesis for Parametric Timed Automata

  2017influential citation
• On the Power of Oracle \varOmega ? for Self-Stabilizing Leader Election in Population Protocols

  2016influential citation
• Self-Stabilizing Clock Synchronization with 3-bit messages

  2016cites this paper
• Self-Stabilizing Computation of Perfect Neighborhood Set in Large Network Graphs

  2016cites this paper
• The Same Speed Timer in Population Protocols

  2016cites this paper
• Realization of Periodic Functions by Self-stabilizing Population Protocols with Synchronous Handshakes

  2016cites this paper
• Global Versus Local Computations: Fast Computing with Identifiers

  2016cites this paper
• Naming a Channel with Beeps

  2016cites this paper
• Weak models of wireless distributed computing Comparison between radio networks and population protocols

  2016influential citation
• Designing minimal effective normative systems with the help of lightweight formal methods

  2016influential citation
• Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits

  2016cites this paper
• Tweaking gossip algorithms for computations in large-scale networks

  2015cites this paper
• On Space and Time Complexity of Loosely-Stabilizing Leader Election

  2015cites this paper
• Constructing self-stabilizing oscillators in population protocols

  2015cites this paper
• Anonymous Processors with Synchronous Shared Memory

  2015cites this paper
• A Totally Distributed Fair Scheduler for Population Protocols by Randomized Handshakes

  2015cites this paper
• Polylogarithmic-Time Leader Election in Population Protocols Using Polylogarithmic States

  2015cites this paper
• Space-Optimal Counting in Population Protocols

  2015cites this paper
• Homonym Population Protocols

  2015cites this paper
• Stable leader election in population protocols requires linear time

  2015cites this paper
• Self-Stabilized Fast Gossiping Algorithms

  2015cites this paper
• Polylogarithmic-Time Leader Election in Population Protocols

  2015cites this paper
• préparée au sein du Laboratoire TIMA dans l'École Doctorale d'Électronique, Électrotechnique, Automatique, et Traitement du Signal (EEATS)

  2014cites this paper
• Speed faults in computation by chemical reaction networks

  2014cites this paper
• Nothing can compare with a population, besides agents

  2014cites this paper
• Space Complexity of Self-Stabilizing Leader Election in Population Protocol on Hypernetworks

  2014cites this paper
• Space-efficient self-stabilizing counting population protocols on mobile sensor networks

  2014cites this paper
• Partially Ordered Knowledge Sharing and Fractionated Systems in the Context of other Models for Distributed Computing

  2014cites this paper
• Etude de la fiabilité des algorithmes self-convergeants face aux soft-erreurs

  2014cites this paper
• Synchronization and Fault-tolerance in Distributed Algorithms

  2014influential citation
• Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols

  2014cites this paper
• A Framework for Robust Address Assignment in WSNs Whispering to Avoid Intruders

  2013cites this paper