On the public citation graph
Self-stabilizing population protocols
0 signed · 116 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jpdc.1996.0066openalex-snapshot
The Stabilizing Token Ring in Three Bits
inferredcites →https://doi.org/10.1007/11502593_8openalex-snapshot
Stably Computable Properties of Network Graphs
inferredcites →https://doi.org/10.1007/3-540-44681-8_67openalex-snapshot
Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler
inferredcites →https://doi.org/10.1007/978-3-540-27820-7_6openalex-snapshot
A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks
inferredcites →https://doi.org/10.1007/bfb0022154openalex-snapshot
Deterministic, constant space, self-stabilizing leader election on uniform rings
inferredcites →https://doi.org/10.1007/s00446-005-0138-3openalex-snapshot
Computation in networks of passively mobile finite-state sensors
inferredcites →https://doi.org/10.1007/s00446-007-0040-2openalex-snapshot
The computational power of population protocols
inferredcites →https://doi.org/10.1016/0020-0190(90)90107-9openalex-snapshot
Probabilistic self-stabilization
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/71.588622openalex-snapshot
Uniform dynamic self-stabilizing leader election
inferredcites →https://doi.org/10.1109/ipdps.2004.1302973openalex-snapshot
Bounded service time and memory space optimal self-stabilizing token circulation protocol on unidirectional rings
inferredcites →https://doi.org/10.1109/sfcs.1987.5openalex-snapshot
Achievable cases in an asynchronous environment
inferredcites →https://doi.org/10.1109/sfcs.1994.365691openalex-snapshot
Fast and lean self-stabilizing asynchronous protocols
inferredcites →https://doi.org/10.1137/0405048openalex-snapshot
Labelling Graphs with a Condition at Distance 2
inferredcites →https://doi.org/10.1145/1073970.1073977openalex-snapshot
Coloring unstructured radio networks
inferredcites →https://doi.org/10.1145/129712.129777openalex-snapshot
Self-stabilizing symmetry breaking in constant-space (extended abstract)
inferredcites →https://doi.org/10.1145/301308.301358openalex-snapshot
Memory space requirements for self-stabilizing leader election protocols
inferredcites →https://doi.org/10.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
inferredcites →https://doi.org/10.11575/prism/30833openalex-snapshot
SELF-STABILIZING TOKEN CIRCULATION ON ANONYMOUS MESSAGE PASSING RINGS
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_4openalex-snapshot
Leader Election in Anonymous Rings: Franklin Goes Probabilistic
inferred← citeshttps://doi.org/10.1007/978-3-030-34992-9_19openalex-snapshot
Fault Tolerant Network Constructors
inferred← citeshttps://doi.org/10.1007/978-3-030-54921-3_14openalex-snapshot
The Power of Global Knowledge on Self-stabilizing Population Protocols
inferred← citeshttps://doi.org/10.1007/978-3-030-59234-9_6openalex-snapshot
A Survey on Analog Models of Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-64348-5_13openalex-snapshot
A Combinatorial Characterization of Self-stabilizing Population Protocols
inferred← citeshttps://doi.org/10.1007/978-3-030-64348-5_24openalex-snapshot
Time-Optimal Self-Stabilizing Leader Election on Rings in Population Protocols
inferred← citeshttps://doi.org/10.1007/978-3-030-89240-1_10openalex-snapshot
Population Protocols with Unreliable Communication
inferred← citeshttps://doi.org/10.1007/978-3-031-63742-1_11openalex-snapshot
On the Simulation Power of Surface Chemical Reaction Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-74498-3_9openalex-snapshot
Complete Graph Identification in Population Protocols
inferred← citeshttps://doi.org/10.1007/978-3-031-91736-3_3openalex-snapshot
Sublinear-Time Collision Detection with a Polynomial Number of States in Population Protocols
inferred← citeshttps://doi.org/10.1007/978-3-319-03089-0_7openalex-snapshot
Space Complexity of Self-Stabilizing Leader Election in Population Protocol Based on k-Interaction
inferred← citeshttps://doi.org/10.1007/978-3-319-03850-6_4openalex-snapshot
Self-stabilizing Leader Election in Population Protocols over Arbitrary Communication Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-14472-6_23openalex-snapshot
Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols
inferred← citeshttps://doi.org/10.1007/978-3-319-21741-3_13openalex-snapshot
Constructing Self-stabilizing Oscillators in Population Protocols
inferred← citeshttps://doi.org/10.1007/978-3-319-25150-9_18openalex-snapshot
A Totally Distributed Fair Scheduler for Population Protocols by Randomized Handshakes
inferred← citeshttps://doi.org/10.1007/978-3-319-25258-2_21openalex-snapshot
On Space and Time Complexity of Loosely-Stabilizing Leader Election
inferred← citeshttps://doi.org/10.1007/978-3-319-49001-4_2openalex-snapshot
Realization of Periodic Functions by Self-stabilizing Population Protocols with Synchronous Handshakes
inferred← citeshttps://doi.org/10.1007/978-3-319-49259-9_3openalex-snapshot
On the Power of Oracle $$\varOmega ?$$ for Self-Stabilizing Leader Election in Population Protocols
inferred← citeshttps://doi.org/10.1007/978-3-319-55911-7_13openalex-snapshot
Mediated Population Protocols: Leader Election and Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-75142-7_8openalex-snapshot
Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_7openalex-snapshot
Making Population Protocols Self-stabilizing
inferred← citeshttps://doi.org/10.1007/978-3-642-05434-1_21openalex-snapshot
Relocation Analysis of Stabilizing MAC Algorithms for Large-Scale Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-25873-2_17openalex-snapshot
Self-stabilizing Mutual Exclusion and Group Mutual Exclusion for Population Protocols with Covering
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_23openalex-snapshot
Computing with Large Populations Using Interactions
inferred← citeshttps://doi.org/10.1007/978-3-642-35476-2_5openalex-snapshot
Non-deterministic Population Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-38613-8_15openalex-snapshot
Formal Modelling and Verification of Population Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-39074-6_5openalex-snapshot
Population Protocols on Graphs: A Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-642-54624-2_20openalex-snapshot
Partially Ordered Knowledge Sharing and Fractionated Systems in the Context of other Models for Distributed Computing
inferred← citeshttps://doi.org/10.1007/978-3-662-48653-5_42openalex-snapshot
Space-Optimal Counting in Population Protocols
inferred← citeshttps://doi.org/10.1007/s00224-017-9833-2openalex-snapshot
Homonym Population Protocols
inferred← citeshttps://doi.org/10.1007/s00446-012-0173-9openalex-snapshot
On space complexity of self-stabilizing leader election in mediated population protocol
inferred← citeshttps://doi.org/10.1007/s00446-015-0249-4openalex-snapshot
Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication
inferred← citeshttps://doi.org/10.1007/s00446-018-0330-xopenalex-snapshot
Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
inferred← citeshttps://doi.org/10.1007/s00446-025-00487-7openalex-snapshot
Near-Optimal Leader Election in Population Protocols on Graphs
inferred← citeshttps://doi.org/10.1007/s10270-015-0504-yopenalex-snapshot
Towards an integrated formal method for verification of liveness properties in distributed systems: with application to population protocols
inferred← citeshttps://doi.org/10.1007/s11704-013-3091-5openalex-snapshot
Model checking with fairness assumptions using PAT
inferred← citeshttps://doi.org/10.1016/j.ic.2016.12.002openalex-snapshot
Constructing self-stabilizing oscillators in population protocols
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105037openalex-snapshot
Fault tolerant network constructors
inferred← citeshttps://doi.org/10.1016/j.ins.2009.10.003openalex-snapshot
Timer-based composition of fault-containing self-stabilizing protocols
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.09.016openalex-snapshot
A self-stabilizing transformer for population protocols with covering
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.07.028openalex-snapshot
Space-efficient self-stabilizing counting population protocols on mobile sensor networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.09.034openalex-snapshot
Loosely-stabilizing leader election with polylogarithmic convergence time
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.09.020openalex-snapshot
Uniform bipartition in the population protocol model with arbitrary graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.11.006openalex-snapshot
Protocols with constant local storage and unreliable communication
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115908openalex-snapshot
Complete graph identification in population protocols
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115989openalex-snapshot
Sublinear-time collision detection in population protocols with polynomially many states
inferred← citeshttps://doi.org/10.1017/s0269888920000429openalex-snapshot
A generic model for representing openness in multi-agent systems
inferred← citeshttps://doi.org/10.1109/allerton.2016.7852357openalex-snapshot
Open multi-agent systems: Gossiping with deterministic arrivals and departures
inferred← citeshttps://doi.org/10.1109/ase.2013.6693062openalex-snapshot
Constraint-based automatic symmetry detection
inferred← citeshttps://doi.org/10.1109/cdc.2017.8263752openalex-snapshot
Open multi-agent systems: Gossiping with random arrivals and departures
inferred← citeshttps://doi.org/10.1109/dasc/picom/cbdcom/cy55231.2022.9927751openalex-snapshot
Implementation and Evaluation of Leader Election in the Population Protocol Model Using an Emulation Environment
inferred← citeshttps://doi.org/10.1109/icdcs.2016.82openalex-snapshot
The Same Speed Timer in Population Protocols
inferred← citeshttps://doi.org/10.1109/icnc.2011.11openalex-snapshot
Probabilistic Self-Stabilization and Random Walks
inferred← citeshttps://doi.org/10.1109/issnip.2015.7106950openalex-snapshot
Tweaking gossip algorithms for computations in large-scale networks
inferred← citeshttps://doi.org/10.1109/tase.2008.8openalex-snapshot
On Automatic Verification of Self-Stabilizing Population Protocols
inferred← citeshttps://doi.org/10.1109/tase.2009.51openalex-snapshot
Verification of Population Ring Protocols in PAT
inferred← citeshttps://doi.org/10.1109/tpds.2018.2881125openalex-snapshot
Loosely-Stabilizing Leader Election for Arbitrary Graphs in Population Protocol Model
inferred← citeshttps://doi.org/10.1109/tpds.2021.3076769openalex-snapshot
Self-Stabilizing Population Protocols With Global Knowledge
inferred← citeshttps://doi.org/10.1109/wi.2016.0069openalex-snapshot
Self-Stabilizing Computation of Perfect Neighborhood Set in Large Network Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611974782.168openalex-snapshot
Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits
inferred← citeshttps://doi.org/10.1137/1.9781611976465.129openalex-snapshot
Self-Stabilizing Clock Synchronization with 1-bit Messages
inferred← citeshttps://doi.org/10.1145/1835698.1835775openalex-snapshot
On utilizing speed in networks of mobile agents
inferred← citeshttps://doi.org/10.1145/1953563.1953572openalex-snapshot
Self-stabilizing tiny interaction protocols
inferred← citeshttps://doi.org/10.1145/2816819openalex-snapshot
Self-Stabilized Fast Gossiping Algorithms
inferred← citeshttps://doi.org/10.1145/2950290.2950307openalex-snapshot
Designing minimal effective normative systems with the help of lightweight formal methods
inferred← citeshttps://doi.org/10.1145/3289137.3289150openalex-snapshot
Recent Algorithmic Advances in Population Protocols
inferred← citeshttps://doi.org/10.1145/3293611.3331616openalex-snapshot
Self-Stabilizing Leader Election
inferred← citeshttps://doi.org/10.1145/3382734.3405733openalex-snapshot
Self-Stabilizing Leader Election in Regular Graphs
inferred← citeshttps://doi.org/10.1145/3388392.3388402openalex-snapshot
Distributed Computing Column 77 Consensus Dynamics
inferred← citeshttps://doi.org/10.1145/3465084.3467915openalex-snapshot
Comparison Dynamics in Population Protocols
inferred← citeshttps://doi.org/10.1145/3519270.3538435openalex-snapshot
Near-Optimal Leader Election in Population Protocols on Graphs
inferred← citeshttps://doi.org/10.1145/3583668.3594586openalex-snapshot
A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States
inferred← citeshttps://doi.org/10.1155/2013/693519openalex-snapshot
A Framework for Robust Address Assignment in WSNs Whispering to Avoid Intruders
inferred← citeshttps://doi.org/10.15480/882.1091openalex-snapshot
Time- and space-efficient self-stabilizing algorithms
inferred← citeshttps://doi.org/10.15803/ijnc.2.2_147openalex-snapshot
Probabilistic Self-Stabilization and Biased Random Walks on Dynamic Graphs
inferred← citeshttps://doi.org/10.1587/transfun.e102.a.1187openalex-snapshot
Sub-Linear Time Aggregation in Probabilistic Population Protocol Model
inferred← citeshttps://doi.org/10.1587/transinf.2019fcp0003openalex-snapshot
Loosely Stabilizing Leader Election on Arbitrary Graphs in Population Protocols without Identifiers or Random Numbers
inferred← citeshttps://doi.org/10.1587/transinf.2023edp7075openalex-snapshot
Loosely-Stabilizing Algorithm on Almost Maximal Independent Set
inferred← citeshttps://doi.org/10.2200/s00328ed1v01y201101dct006openalex-snapshot
New Models for Population Protocols
inferred← citeshttps://doi.org/10.4204/eptcs.300.7openalex-snapshot
Immediate Observation in Mediated Population Protocols
inferred← citeshttps://doi.org/10.4230/lipics.disc.2021.34openalex-snapshot
Smoothed Analysis of Population Protocols
inferred← citeshttps://doi.org/10.4230/lipics.disc.2021.40openalex-snapshot
Time-Optimal Loosely-Stabilizing Leader Election in Population Protocols
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2018.49openalex-snapshot
Limits for Rumor Spreading in Stochastic Populations
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2020.33openalex-snapshot
Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1311.3425openalex-snapshot
Breathe before Speaking: Efficient Information Dissemination Despite Noisy, Limited and Anonymous Communication
inferred← citeshttps://doi.org/10.48550/arxiv.1507.02272openalex-snapshot
Anonymous Processors with Synchronous Shared Memory
inferred← citeshttps://doi.org/10.48550/arxiv.1609.06508openalex-snapshot
Global Versus Local Computations: Fast Computing with Identifiers
inferred← citeshttps://doi.org/10.48550/arxiv.1803.02540openalex-snapshot
Population stability: regulating size in the presence of an adversary
inferred← citeshttps://doi.org/10.48550/arxiv.1910.06716openalex-snapshot
Byzantine-Tolerant Register in a System with Continuous Churn
inferred← citeshttps://doi.org/10.48550/arxiv.2003.06485openalex-snapshot
Robust Comparison in Population Protocols
inferred← citeshttps://doi.org/10.70675/0281eff7z6f0bz437dz8303z86fadcfaa093openalex-snapshot
Computing models for networks of tiny objects
inferred← citeshttps://doi.org/10.70675/52d46fa0zd44dz4171z976azca17c71661c8openalex-snapshot
Synchronization and Fault-tolerance in Distributed Algorithms
inferred← citeshttps://doi.org/10.70675/807c9df9z503fz4f71z8c2czcbc795c262efopenalex-snapshot
Search and broadcast in stochastic environments, a biological perspective
inferred← citeshttps://doi.org/10.70675/f4260003z4c14z4ff4z90c3zf7e12f9cded4openalex-snapshot
Etude de la fiabilité des algorithmes self-convergeants face aux soft-erreurs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.