On the public citation graph
Strong stable properties in distributed systems
0 signed · 39 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-18740-5_98openalex-snapshot
Distributed infimum approximation
inferredcites →https://doi.org/10.1007/bf01782776openalex-snapshot
Algorithms for distributed termination detection
inferredcites →https://doi.org/10.1007/bfb0022453openalex-snapshot
Using consistent subcuts for detecting stable properties
inferredcites →https://doi.org/10.1016/0020-0190(80)90021-6openalex-snapshot
Termination detection for diffusing computations
inferredcites →https://doi.org/10.1016/0020-0190(87)90125-6openalex-snapshot
On distributed snapshots
inferredcites →https://doi.org/10.1016/0167-6423(88)90024-xopenalex-snapshot
The derivation of graph marking algorithms from distributed termination detection protocols
inferredcites →https://doi.org/10.1016/0167-8191(89)90127-0openalex-snapshot
An efficient reference counting solution to the distributed garbage collection problem
inferredcites →https://doi.org/10.1016/0743-7315(86)90015-8openalex-snapshot
Termination detection for dynamically distributed systems with non-first-in-first-out communication
inferredcites →https://doi.org/10.1016/0743-7315(90)90099-bopenalex-snapshot
A message-optimal algorithm for distributed termination detection
inferredcites →https://doi.org/10.1109/2.43525openalex-snapshot
Deadlock detection in distributed systems
inferredcites →https://doi.org/10.1109/pccc.1990.101609openalex-snapshot
Computing particular snapshots in distributed systems
inferredcites →https://doi.org/10.1109/spdp.1990.143519openalex-snapshot
Correct two-phase and one-phase deadlock detection algorithms for distributed systems
inferredcites →https://doi.org/10.1109/tse.1982.235573openalex-snapshot
Echo Algorithms: Depth Parallel Operations on General Graphs
inferredcites →https://doi.org/10.1145/128738.128742openalex-snapshot
Lightweight causal and atomic group multicast
inferredcites →https://doi.org/10.1145/151646.151647openalex-snapshot
The derivation of distributed termination detection algorithms from garbage collection schemes
inferredcites →https://doi.org/10.1145/3335772.3335934openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/359545.359563openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/382192.383004openalex-snapshot
Concepts and paradigms of object-oriented programming
inferredcites →https://doi.org/10.1145/45075.46163openalex-snapshot
Deadlock detection in distributed databases
inferredcites →https://doi.org/10.1145/73141.74846openalex-snapshot
Generational reference counting: a reduced-communication distributed storage reclamation scheme
inferredcites →https://doi.org/10.1145/74818.74846openalex-snapshot
Generational reference counting: a reduced-communication distributed storage reclamation scheme
inferredcites →https://doi.org/10.21236/ada237122openalex-snapshot
Using Consistent Subcuts for Detecting Stable Properties
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1818openalex-snapshot
Communication Patterns in Distributed Computations
inferred← citeshttps://doi.org/10.1007/11590156_34openalex-snapshot
Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed Systems
inferred← citeshttps://doi.org/10.1007/11596356_58openalex-snapshot
Nonintrusive Snapshots Using Thin Slices
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_113openalex-snapshot
Universal Constructs in Distributed Computations
inferred← citeshttps://doi.org/10.1007/978-3-642-31104-8_18openalex-snapshot
On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/bf02280830openalex-snapshot
Efficient detection of a class of stable properties
inferred← citeshttps://doi.org/10.1016/j.jpdc.2013.09.009openalex-snapshot
Detecting stable locality-aware predicates
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00195-3openalex-snapshot
A framework for viewing atomic events in distributed computations
inferred← citeshttps://doi.org/10.1109/acsc.2001.906619openalex-snapshot
Starting with termination: a methodology for building distributed garbage collection algorithms
inferred← citeshttps://doi.org/10.1109/icppw.2012.87openalex-snapshot
Detecting Tree Distributed Predicates
inferred← citeshttps://doi.org/10.1109/tse.2007.1000openalex-snapshot
Detecting Arbitrary Stable Properties Using Efficient Snapshots
inferred← citeshttps://doi.org/10.1145/168619.168623openalex-snapshot
Understanding the limitations of causally and totally ordered communication
inferred← citeshttps://doi.org/10.1145/1968513.1968516openalex-snapshot
Detecting Locally Distributed Predicates
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.