On the public citation graph

The Same Speed Timer in Population Protocols

0 signed · 24 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/11864219_5openalex-snapshot
Fast Computation by Population Protocols with a Leader
inferredcites →https://doi.org/10.1007/11945529_28openalex-snapshot
Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents
inferredcites →https://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
inferredcites →https://doi.org/10.1007/978-3-319-03850-6_4openalex-snapshot
Self-stabilizing Leader Election in Population Protocols over Arbitrary Communication Graphs
inferredcites →https://doi.org/10.1007/978-3-319-14472-6_23openalex-snapshot
Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols
inferredcites →https://doi.org/10.1007/978-3-319-25258-2_21openalex-snapshot
On Space and Time Complexity of Loosely-Stabilizing Leader Election
inferredcites →https://doi.org/10.1007/978-3-642-35476-2_5openalex-snapshot
Non-deterministic Population Protocols
inferredcites →https://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
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-012-0173-9openalex-snapshot
On space complexity of self-stabilizing leader election in mediated population protocol
inferredcites →https://doi.org/10.1016/j.tcs.2011.02.003openalex-snapshot
Mediated population protocols
inferredcites →https://doi.org/10.1016/j.tcs.2012.01.007openalex-snapshot
Loosely-stabilizing leader election in a population protocol model
inferredcites →https://doi.org/10.1017/cbo9780511813603openalex-snapshot
Probability and Computing
inferredcites →https://doi.org/10.1145/1452001.1452003openalex-snapshot
Self-stabilizing population protocols

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-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_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/s00446-025-00487-7openalex-snapshot
Near-Optimal Leader Election in Population Protocols on Graphs
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.1109/ipdpsw.2018.00128openalex-snapshot
A Population Protocol for Uniform k-Partition Under Global Fairness
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/3519270.3538435openalex-snapshot
Near-Optimal Leader Election in Population Protocols on Graphs
inferred← citeshttps://doi.org/10.1587/transinf.2018fcp0009openalex-snapshot
Space-Optimal Population Protocols for Uniform Bipartition Under Global Fairness
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.