On the public citation graph
A technique for constructing highly available services
0 signed · 33 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-08755-9_9openalex-snapshot
Notes on data base operating systems
inferredcites →https://doi.org/10.1109/tse.1983.236733openalex-snapshot
Detection of Mutual Inconsistency in Distributed Systems
inferredcites →https://doi.org/10.1109/tse.1987.232835openalex-snapshot
Distributed Version Management for Read-Only Actions
inferredcites →https://doi.org/10.1145/10590.10593openalex-snapshot
Highly available distributed services and fault-tolerant distributed garbage collection
inferredcites →https://doi.org/10.1145/2166.357215openalex-snapshot
Guardians and Actions: Linguistic Support for Robust, Distributed Programs
inferredcites →https://doi.org/10.1145/325405.325443openalex-snapshot
An efficient, fault-tolerant protocol for replicated data management
inferredcites →https://doi.org/10.1145/37499.37515openalex-snapshot
Exploiting virtual synchrony in distributed systems
inferredcites →https://doi.org/10.1145/41457.37515openalex-snapshot
Exploiting virtual synchrony in distributed systems
inferredcites →https://doi.org/10.1145/588111.588124openalex-snapshot
Sacrificing serializability to attain high availability of data in an unreliable network
inferredcites →https://doi.org/10.1145/6012.15418openalex-snapshot
Availability in partitioned replicated databases
inferredcites →https://doi.org/10.1145/63500.63501openalex-snapshot
Maintaining availability in partitioned replicated databases
inferredcites →https://doi.org/10.1145/800215.806583openalex-snapshot
Weighted voting for replicated data
inferredcites →https://doi.org/10.1145/800222.806750openalex-snapshot
Efficient solutions to the replicated log and dictionary problems
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.1995.1016openalex-snapshot
A Token-Based Fault-Tolerant Distributed Mutual Exclusion Algorithm
inferred← citeshttps://doi.org/10.1007/bfb0042342openalex-snapshot
Bibliography for fault-tolerant distributed computing
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00182-xopenalex-snapshot
An algorithm for dynamic data allocation in distributed systems
inferred← citeshttps://doi.org/10.1109/12.286303openalex-snapshot
Information dissemination in distributed systems with faulty units
inferred← citeshttps://doi.org/10.1109/32.341843openalex-snapshot
The location-based paradigm for replication: Achieving efficiency and availability in distributed systems
inferred← citeshttps://doi.org/10.1109/icde.1993.344051openalex-snapshot
A competitive dynamic data replication algorithm
inferred← citeshttps://doi.org/10.1109/mrd.1990.138240openalex-snapshot
Lazy replication: exploiting the semantics of distributed services
inferred← citeshttps://doi.org/10.1109/mrd.1992.242616openalex-snapshot
An algorithm for dynamic data distribution
inferred← citeshttps://doi.org/10.1145/113413.113419openalex-snapshot
Bounded ignorance in replicated systems
inferred← citeshttps://doi.org/10.1145/137097.137858openalex-snapshot
Distributed algorithms for dynamic replication of data
inferred← citeshttps://doi.org/10.1145/138873.138877openalex-snapshot
Providing high availability using lazy replication
inferred← citeshttps://doi.org/10.1145/249978.249982openalex-snapshot
An adaptive data replication algorithm
inferred← citeshttps://doi.org/10.1145/62546.62549openalex-snapshot
Viewstamped replication: a general primary copy
inferred← citeshttps://doi.org/10.1147/sj.421.0085openalex-snapshot
Competitive algorithms for the dynamic selection of component implementations
inferred← citeshttps://doi.org/10.21236/ada252875openalex-snapshot
An Algorithm for Dynamic Data Distribution, Preliminary Version
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.