On the public citation graph
Stably Computable Properties of Network Graphs
0 signed · 109 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.1007/3-540-55610-9_177openalex-snapshot
A survey of basic net models and modular net classes
inferredcites →https://doi.org/10.1007/3-540-65306-6openalex-snapshot
Lectures on Petri Nets I: Basic Models
inferredcites →https://doi.org/10.1007/3-540-65306-6_20openalex-snapshot
Decidability and complexity of Petri net problems — An introduction
inferredcites →https://doi.org/10.1007/bf03160228openalex-snapshot
A simple game for the study of trust in distributed systems
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/0304-3975(79)90041-0openalex-snapshot
On the reachability problem for 5-dimensional vector addition systems
inferredcites →https://doi.org/10.1016/0304-3975(92)90185-iopenalex-snapshot
The chemical abstract machine
inferredcites →https://doi.org/10.1016/j.tcs.2003.10.028openalex-snapshot
Catalytic P systems, semilinear sets, and vector addition systems
inferredcites →https://doi.org/10.1109/jproc.2003.814921openalex-snapshot
Collaborative signal and information processing: An information-directed approach
inferredcites →https://doi.org/10.1109/sfcs.1994.365691openalex-snapshot
Fast and lean self-stabilizing asynchronous protocols
inferredcites →https://doi.org/10.1109/tnet.2002.801403openalex-snapshot
Mobility increases the capacity of ad hoc wireless networks
inferredcites →https://doi.org/10.1137/0213029openalex-snapshot
An Algorithm for the General Petri Net Reachability Problem
inferredcites →https://doi.org/10.1145/1011767.1011810openalex-snapshot
Computation in networks of passively mobile finite-state sensors
inferredcites →https://doi.org/10.1145/322374.322380openalex-snapshot
On Communicating Finite-State Machines
inferredcites →https://doi.org/10.1145/584490.584493openalex-snapshot
Smart dust protocols for local detection and propagation
inferredcites →https://doi.org/10.1145/778415.778436openalex-snapshot
Lightweight sensing and communication protocols for target enumeration and aggregation
inferredcites →https://doi.org/10.1145/990064.990094openalex-snapshot
Electronic shepherd - a low-cost, low-bandwidth, wireless network system
inferredcites →https://doi.org/10.2140/pjm.1966.16.285openalex-snapshot
Semigroups, Presburger formulas, and languages
inferredcites →https://doi.org/10.48456/tr-523openalex-snapshot
Bigraphical reactive systems: basic theory
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_4openalex-snapshot
When Birds Die: Making Population Protocols Fault-Tolerant
inferred← citeshttps://doi.org/10.1007/11795490_10openalex-snapshot
Self-stabilizing Population Protocols
inferred← citeshttps://doi.org/10.1007/11795490_30openalex-snapshot
On the Power of Anonymous One-Way Communication
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-3-030-59234-9_6openalex-snapshot
A Survey on Analog Models of Computation
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-74580-5_13openalex-snapshot
Modular Population Protocols
inferred← citeshttps://doi.org/10.1007/978-3-319-00200-2_16openalex-snapshot
Conditions for Correct Sensor Network Localization Using SDP Relaxation
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-21741-3_13openalex-snapshot
Constructing Self-stabilizing Oscillators in 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-46376-6_15openalex-snapshot
Connectivity Preserving Network Transformers
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-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-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-02930-1_30openalex-snapshot
Mediated Population Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_6openalex-snapshot
Recent Advances in Population Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-10877-8_5openalex-snapshot
Not All Fair Probabilistic Schedulers Are Equivalent
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-14849-1_5openalex-snapshot
Population Protocols and Related Models
inferred← citeshttps://doi.org/10.1007/978-3-642-16023-3_21openalex-snapshot
Stably Decidable Graph Languages by Mediated Population Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-16023-3_44openalex-snapshot
Storage Capacity of Labeled Graphs
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-24550-3_12openalex-snapshot
The Computational Power of Simple Protocols for Self-awareness on Graphs
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-32589-2_23openalex-snapshot
Computing with Large Populations Using Interactions
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_5openalex-snapshot
Non-deterministic 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-40663-8_19openalex-snapshot
Approximation of Large Probabilistic Networks by Structured Population Protocols
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-43951-7_16openalex-snapshot
Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs
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/s00224-017-9833-2openalex-snapshot
Homonym Population Protocols
inferred← citeshttps://doi.org/10.1007/s00446-005-0138-3openalex-snapshot
Computation in networks of passively mobile finite-state sensors
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-012-0173-9openalex-snapshot
On space complexity of self-stabilizing leader election in mediated population protocol
inferred← citeshttps://doi.org/10.1007/s00446-015-0257-4openalex-snapshot
Simple and efficient local codes for distributed stable network construction
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.cosrev.2010.09.001openalex-snapshot
Computational models for networks of tiny artifacts: A survey
inferred← citeshttps://doi.org/10.1016/j.ic.2013.11.004openalex-snapshot
Effective storage capacity of labeled graphs
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.jpdc.2015.02.005openalex-snapshot
Terminating population protocols via some minimal global knowledge assumptions
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.02.003openalex-snapshot
Mediated population protocols
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.07.001openalex-snapshot
Passively mobile communicating machines that use restricted space
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.2014.07.028openalex-snapshot
Space-efficient self-stabilizing counting population protocols on mobile sensor networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.02.040openalex-snapshot
Connectivity preserving network transformers
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/icdcs.2019.00208openalex-snapshot
A Population Protocol Model with Interaction Probability Considering Speeds of Agents
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/wi.2016.0069openalex-snapshot
Self-Stabilizing Computation of Perfect Neighborhood Set in Large Network Graphs
inferred← citeshttps://doi.org/10.1145/1011767.1011810openalex-snapshot
Computation in networks of passively mobile finite-state sensors
inferred← citeshttps://doi.org/10.1145/1146381.1146425openalex-snapshot
Stably computable predicates are semilinear
inferred← citeshttps://doi.org/10.1145/1452001.1452003openalex-snapshot
Self-stabilizing population protocols
inferred← citeshttps://doi.org/10.1145/1998476.1998480openalex-snapshot
Passively mobile communicating machines that use restricted space
inferred← citeshttps://doi.org/10.1145/2484239.2484244openalex-snapshot
Stone age distributed computing
inferred← citeshttps://doi.org/10.1145/2611462.2611466openalex-snapshot
Simple and efficient local codes for distributed stable network construction
inferred← citeshttps://doi.org/10.1145/3465084.3467918openalex-snapshot
Decision Power of Weak Asynchronous Models of Distributed Computing
inferred← citeshttps://doi.org/10.1145/3519270.3538435openalex-snapshot
Near-Optimal Leader Election in Population Protocols on Graphs
inferred← citeshttps://doi.org/10.2200/s00328ed1v01y201101dct006openalex-snapshot
New Models for Population Protocols
inferred← citeshttps://doi.org/10.3929/ethz-a-010596095openalex-snapshot
Anonymous Distributed Computing: Computability, Randomization and Checkability
inferred← citeshttps://doi.org/10.4230/lipics.concur.2020.10openalex-snapshot
A Classification of Weak Asynchronous Models of Distributed Computing
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.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.4230/lipics.stacs.2018.16openalex-snapshot
Large Flocks of Small Birds: On the Minimal Size of Population Protocols
inferred← citeshttps://doi.org/10.48550/arxiv.0806.3471openalex-snapshot
Stabilizing Tiny Interaction Protocols
inferred← citeshttps://doi.org/10.48550/arxiv.1004.3395openalex-snapshot
Passively Mobile Communicating Logarithmic Space Machines
inferred← citeshttps://doi.org/10.48550/arxiv.1010.2262openalex-snapshot
On Sensor Network Localization Using SDP Relaxation
inferred← citeshttps://doi.org/10.48550/arxiv.1109.4433openalex-snapshot
Asymetric Pavlovian Populations
inferred← citeshttps://doi.org/10.48550/arxiv.1309.6978openalex-snapshot
Simple and Efficient Local Codes for Distributed Stable Network Construction
inferred← citeshttps://doi.org/10.48550/arxiv.1602.03540openalex-snapshot
Homonym Population Protocols
inferred← citeshttps://doi.org/10.48550/arxiv.1609.06508openalex-snapshot
Global Versus Local Computations: Fast Computing with Identifiers
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
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.