On the public citation graph

Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents

0 signed · 113 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.1007/11502593_8openalex-snapshot
Stably Computable Properties of Network Graphs
inferredcites →https://doi.org/10.1007/11795490_10openalex-snapshot
Self-stabilizing Population Protocols
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.1016/0020-0190(96)00121-4openalex-snapshot
An exercise in fault-containment: Self-stabilizing leader election
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/dsn.2006.34openalex-snapshot
Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony
inferredcites →https://doi.org/10.1145/1011767.1011810openalex-snapshot
Computation in networks of passively mobile finite-state sensors
inferredcites →https://doi.org/10.1145/1011767.1011816openalex-snapshot
Communication-efficient leader election and consensus with limited link synchrony
inferredcites →https://doi.org/10.1145/151254.151256openalex-snapshot
Self-stabilization
inferredcites →https://doi.org/10.1145/226643.226647openalex-snapshot
Unreliable failure detectors for reliable distributed systems
inferredcites →https://doi.org/10.1145/234533.234549openalex-snapshot
The weakest failure detector for solving consensus
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-01325-7_7openalex-snapshot
Brief Announcement: Fast Approximate Counting and Leader Election in Populations
inferred← citeshttps://doi.org/10.1007/978-3-030-03232-6_11openalex-snapshot
Simple and Fast Approximate Counting and Leader Election in Populations
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-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-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-032-11127-2_16openalex-snapshot
Self-stabilizing Mutual Exclusion in Dynamic Networks with Bounded Temporal Diameter
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-25258-2_21openalex-snapshot
On Space and Time Complexity of Loosely-Stabilizing Leader Election
inferred← citeshttps://doi.org/10.1007/978-3-319-28472-9_4openalex-snapshot
The Weakest Oracle for Symmetric Consensus in Population Protocols
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-51753-7_13openalex-snapshot
Population Protocols for Majority in Arbitrary Networks
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-76627-8_7openalex-snapshot
Stabilizing Flocking Via Leader Election in Robot Networks
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-540-89707-1_5openalex-snapshot
An Introduction to 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-05089-3_9openalex-snapshot
Fair Model Checking with Process Counter Abstraction
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-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-13651-1_26openalex-snapshot
Self-stabilizing Synchronization in Mobile Sensor Networks with Covering
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-24550-3_12openalex-snapshot
The Computational Power of Simple Protocols for Self-awareness on Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-24550-3_6openalex-snapshot
Computing Time Complexity of Population Protocols with Cover Times - The ZebraNet Example
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-29952-0_47openalex-snapshot
Proving Liveness Property under Strengthened Compassion Requirements
inferred← citeshttps://doi.org/10.1007/978-3-642-33536-5_8openalex-snapshot
Terminating Population Protocols via Some Minimal Global Knowledge Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-642-35476-2_20openalex-snapshot
Wait-Free Stabilizing Dining Using Regular Registers
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-45249-9_38openalex-snapshot
Stabilizing Dining with Failure Locality 1
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_72openalex-snapshot
Determining Majority in Networks with Local Interactions and Very Small Local Memory
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/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/s00446-007-0040-2openalex-snapshot
The computational power of 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-016-0277-8openalex-snapshot
Determining majority in networks with local interactions and very small local memory
inferred← citeshttps://doi.org/10.1007/s00446-020-00377-0openalex-snapshot
Fault-tolerant simulation of population protocols
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.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/s11227-015-1460-6openalex-snapshot
Eventual election of multiple leaders for solving consensus in anonymous systems
inferred← citeshttps://doi.org/10.1007/s11704-008-0040-9openalex-snapshot
On automatic verification of self-stabilizing 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.1007/s11704-018-6173-6openalex-snapshot
Probabilistic verification of hierarchical leader election protocol in dynamic systems
inferred← citeshttps://doi.org/10.1016/j.adhoc.2012.05.001openalex-snapshot
Direction election in flocking swarms
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104698openalex-snapshot
Simple and fast approximate counting and leader election in populations
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105037openalex-snapshot
Fault tolerant network constructors
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.06.003openalex-snapshot
Fast leader election in anonymous rings with bounded expected delay
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.05.001openalex-snapshot
Clocked population protocols
inferred← citeshttps://doi.org/10.1016/j.jpdc.2015.02.005openalex-snapshot
Terminating population protocols via some minimal global knowledge assumptions
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.2012.01.007openalex-snapshot
Loosely-stabilizing leader election in a population protocol model
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.08.026openalex-snapshot
The computational power of simple protocols for self-awareness on graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.10.032openalex-snapshot
Tight complexity analysis of population protocols with cover times — The ZebraNet example
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.2018.09.005openalex-snapshot
Population protocols with faulty interactions: The impact of a leader
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.1109/ase.2013.6693062openalex-snapshot
Constraint-based automatic symmetry detection
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/eurocon.2017.8011239openalex-snapshot
A hybrid MAC scheme for wireless vehicular communication
inferred← citeshttps://doi.org/10.1109/icdcs.2016.82openalex-snapshot
The Same Speed Timer in Population Protocols
inferred← citeshttps://doi.org/10.1109/icdcs57875.2023.00032openalex-snapshot
Churn-Tolerant Leader Election Protocols
inferred← citeshttps://doi.org/10.1109/icocs.2015.7483319openalex-snapshot
Formalism of self-stabilization with linear temporal logic and its verification
inferred← citeshttps://doi.org/10.1109/ipdpsw.2010.5470838openalex-snapshot
Randomized self-stabilizing leader election in preference-based anonymous trees
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.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.1145/1806689.1806760openalex-snapshot
Distributed computation in dynamic networks
inferred← citeshttps://doi.org/10.1145/1835698.1835775openalex-snapshot
On utilizing speed in networks of mobile agents
inferred← citeshttps://doi.org/10.1145/1860684.1860700openalex-snapshot
Direction election in flocking swarms
inferred← citeshttps://doi.org/10.1145/1953563.1953572openalex-snapshot
Self-stabilizing tiny interaction protocols
inferred← citeshttps://doi.org/10.1145/3087801.3087836openalex-snapshot
Clocked 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/3465084.3467898openalex-snapshot
Time-Optimal Self-Stabilizing Leader Election in Population Protocols
inferred← citeshttps://doi.org/10.14569/ijacsa.2015.060834openalex-snapshot
Model Checking Self-Stabilising in Embedded Systems with Linear Temporal Logic
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.4230/lipics.disc.2021.34openalex-snapshot
Smoothed Analysis of Population Protocols
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.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.1003.2084openalex-snapshot
Asynchronous Bounded Expected Delay Networks
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.1806.02638openalex-snapshot
Fast Approximate Counting and Leader Election in Populations
inferred← citeshttps://doi.org/10.5753/wesaac.2008.33081openalex-snapshot
Uma Arquitetura de Sistema Multiagente para o TAC-SCM
inferred← citeshttps://doi.org/10.70675/0281eff7z6f0bz437dz8303z86fadcfaa093openalex-snapshot
Computing models for networks of tiny objects
inferred← citeshttps://doi.org/10.70675/45054e37z4b16z4c9fz871dz8efaa3473d6aopenalex-snapshot
Power-Aware Protocols for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.70675/52d46fa0zd44dz4171z976azca17c71661c8openalex-snapshot
Synchronization and Fault-tolerance in Distributed Algorithms
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.