On the public citation graph

Self-stabilizing Population Protocols

0 signed · 78 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.
Claim with ORCID
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.
See reference health

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.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/1011767.1011810openalex-snapshot
Computation in networks of passively mobile finite-state sensors
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/11776178_3openalex-snapshot
Stabilizing Consensus in Mobile Networks
inferred← citeshttps://doi.org/10.1007/11801412_17openalex-snapshot
Dark Encounter Computations
inferred← citeshttps://doi.org/10.1007/11864219_5openalex-snapshot
Fast Computation by Population Protocols with a Leader
inferred← citeshttps://doi.org/10.1007/11945529_28openalex-snapshot
Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents
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-031-49555-7_10openalex-snapshot
Trends and Questions in Open Multi-agent Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-74580-5_13openalex-snapshot
Modular Population Protocols
inferred← citeshttps://doi.org/10.1007/978-3-319-26850-7_9openalex-snapshot
Homonym Population Protocols
inferred← citeshttps://doi.org/10.1007/978-3-319-68690-5_15openalex-snapshot
Classification-Based Parameter Synthesis for Parametric Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-72050-0_6openalex-snapshot
Global Versus Local Computations: Fast Computing with Identifiers
inferred← citeshttps://doi.org/10.1007/978-3-540-74593-8_2openalex-snapshot
On the Computational Capabilities of Several Models
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-540-76627-8_7openalex-snapshot
Stabilizing Flocking Via Leader Election in Robot Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-77096-1_22openalex-snapshot
On the Self-stabilization of Mobile Robots in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77096-1_24openalex-snapshot
Secretive Birds: Privacy in Population Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_59openalex-snapshot
PAT: Towards Flexible Verification under Fairness
inferred← citeshttps://doi.org/10.1007/978-3-642-10373-5_22openalex-snapshot
Scalable Multi-core Model Checking Fairness Enhanced Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-11476-2_10openalex-snapshot
Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents
inferred← citeshttps://doi.org/10.1007/978-3-642-11476-2_23openalex-snapshot
Loosely-Stabilizing Leader Election in Population Protocol Model
inferred← citeshttps://doi.org/10.1007/978-3-642-11476-2_7openalex-snapshot
On Gossip and Populations
inferred← citeshttps://doi.org/10.1007/978-3-642-17653-1_35openalex-snapshot
Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol
inferred← citeshttps://doi.org/10.1007/978-3-642-17653-1_36openalex-snapshot
Improving Space Complexity of Self-stabilizing Counting on Mobile Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-21437-0_32openalex-snapshot
On Combining State Space Reductions with Global Fairness Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-642-25873-2_28openalex-snapshot
Computing with Pavlovian Populations
inferred← citeshttps://doi.org/10.1007/978-3-642-29952-0_47openalex-snapshot
Proving Liveness Property under Strengthened Compassion Requirements
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-41527-2_31openalex-snapshot
Trustful Population Protocols
inferred← citeshttps://doi.org/10.1007/978-3-662-45174-8_2openalex-snapshot
Speed Faults in Computation by Chemical Reaction Networks
inferred← citeshttps://doi.org/10.1007/978-3-662-47666-6_38openalex-snapshot
Polylogarithmic-Time Leader Election in Population Protocols
inferred← citeshttps://doi.org/10.1007/978-3-662-48653-5_40openalex-snapshot
Stable Leader Election in Population Protocols Requires Linear Time
inferred← citeshttps://doi.org/10.1007/s00224-011-9313-zopenalex-snapshot
How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model
inferred← citeshttps://doi.org/10.1007/s00354-020-00092-1openalex-snapshot
Distributed Computing Theory for Molecular Robot Systems
inferred← citeshttps://doi.org/10.1007/s00446-007-0040-2openalex-snapshot
The computational power of population protocols
inferred← citeshttps://doi.org/10.1007/s00446-008-0067-zopenalex-snapshot
Fast computation by population protocols with a leader
inferred← citeshttps://doi.org/10.1007/s00446-015-0255-6openalex-snapshot
Speed faults in computation by chemical reaction networks
inferred← citeshttps://doi.org/10.1007/s00446-026-00509-yopenalex-snapshot
Time-optimal self-stabilizing leader election in population protocols
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.007openalex-snapshot
Loosely-stabilizing leader election in a population protocol model
inferred← citeshttps://doi.org/10.1049/iet-spr.2020.0297openalex-snapshot
Broadcast distributed voting algorithm in population protocols
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/icdcs.2019.00208openalex-snapshot
A Population Protocol Model with Interaction Probability Considering Speeds of Agents
inferred← citeshttps://doi.org/10.1109/ict.2014.6845151openalex-snapshot
Nothing can compare with a population, besides agents
inferred← citeshttps://doi.org/10.1109/ictel.2010.5478801openalex-snapshot
Dynamic computation of population protocols
inferred← citeshttps://doi.org/10.1109/ipdpsw.2018.00128openalex-snapshot
A Population Protocol for Uniform k-Partition Under Global Fairness
inferred← citeshttps://doi.org/10.1109/secureware.2007.4385318openalex-snapshot
Robust sensor self-initialization: Whispering to avoid intruders
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/tase.2009.9openalex-snapshot
Verifying Self-stabilizing Population Protocols with Coq
inferred← citeshttps://doi.org/10.1145/1281100.1281191openalex-snapshot
Self-stabilizing counting in mobile sensor networks
inferred← citeshttps://doi.org/10.1145/3465084.3467898openalex-snapshot
Time-Optimal Self-Stabilizing Leader Election in Population Protocols
inferred← citeshttps://doi.org/10.1145/3583668.3594571openalex-snapshot
Brief Announcement: Population Protocols Decide Double-exponential Thresholds
inferred← citeshttps://doi.org/10.1145/3796701.3815940openalex-snapshot
Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
inferred← citeshttps://doi.org/10.1587/transinf.2018fcp0009openalex-snapshot
Space-Optimal Population Protocols for Uniform Bipartition Under Global Fairness
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2019.8openalex-snapshot
Uniform Partition in Population Protocol Model Under Weak Fairness
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2021.13openalex-snapshot
Population Protocols for Graph Class Identification Problems
inferred← citeshttps://doi.org/10.48550/arxiv.0806.3471openalex-snapshot
Stabilizing Tiny Interaction Protocols
inferred← citeshttps://doi.org/10.48550/arxiv.1109.4433openalex-snapshot
Asymetric Pavlovian Populations
inferred← citeshttps://doi.org/10.48550/arxiv.1502.05745openalex-snapshot
Polylogarithmic-Time Leader Election in Population Protocols Using Polylogarithmic States
inferred← citeshttps://doi.org/10.48550/arxiv.1602.03540openalex-snapshot
Homonym Population Protocols
inferred← citeshttps://doi.org/10.70675/45054e37z4b16z4c9fz871dz8efaa3473d6aopenalex-snapshot
Power-Aware Protocols for Wireless Sensor Networks
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.