On the public citation graph

Lifetime based consistency protocols for distributed objects

https://doi.org/10.1007/bfb0056496
0 signed · 28 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/3-540-60692-0_48openalex-snapshot
From causal consistency to sequential consistency in shared memory systems
inferredcites →https://doi.org/10.1007/3-540-61769-8_6openalex-snapshot
Plausible clocks: Constant size logical clocks for Distributed Systems
inferredcites →https://doi.org/10.1007/bf01784241openalex-snapshot
Causal memory: definitions, implementation, and programming
inferredcites →https://doi.org/10.1016/0020-0190(91)90055-mopenalex-snapshot
Concerning the size of logical clocks in distributed systems
inferredcites →https://doi.org/10.1109/2.485846openalex-snapshot
Logical time: capturing causality in distributed systems
inferredcites →https://doi.org/10.1109/2.84874openalex-snapshot
Logical time in distributed computing systems
inferredcites →https://doi.org/10.1109/52.542297openalex-snapshot
Fundamentals of distributed system observation
inferredcites →https://doi.org/10.1109/empdp.1998.647193openalex-snapshot
Exploiting write semantics in implementing partially replicated causal objects
inferredcites →https://doi.org/10.1109/icdcs.1996.507971openalex-snapshot
A scalable technique for implementing multiple consistency levels for distributed objects
inferredcites →https://doi.org/10.1109/reldis.1998.740503openalex-snapshot
Fault-tolerant Total Order Multicast to asynchronous groups
inferredcites →https://doi.org/10.1109/tc.1979.1675439openalex-snapshot
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
inferredcites →https://doi.org/10.1109/wmcsa.1994.19openalex-snapshot
Detecting Mutual Consistency of Shared Objects
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/504450.504480openalex-snapshot
Scalable information sharing in large scale distributed systems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11516798_25openalex-snapshot
Analyzing Convergence in Consistency Models for Distributed Objects
inferred← citeshttps://doi.org/10.1007/3-540-37795-6_14openalex-snapshot
Ordering vs Timeliness: Two Facets of Consistency?
inferred← citeshttps://doi.org/10.1007/978-3-642-38123-2_16openalex-snapshot
Atomic Consistency (Linearizability)
inferred← citeshttps://doi.org/10.1007/bfb0056476openalex-snapshot
A decision-theoretic approach to reliable message delivery
inferred← citeshttps://doi.org/10.1007/pl00008922openalex-snapshot
A decision-theoretic approach to reliable message delivery
inferred← citeshttps://doi.org/10.1007/s004460050065openalex-snapshot
Plausible clocks: constant size logical clocks for distributed systems
inferred← citeshttps://doi.org/10.1109/tpds.2017.2740174openalex-snapshot
Value the Recent Past: Approximate Causal Consistency for Partially Replicated Systems
inferred← citeshttps://doi.org/10.1109/words.2001.945127openalex-snapshot
Real-time based strong consistency for distributed objects
inferred← citeshttps://doi.org/10.1145/1031154.1031156openalex-snapshot
Consistency models for distributed interactive multimedia applications
inferred← citeshttps://doi.org/10.1145/301308.301350openalex-snapshot
Timed consistency for shared distributed objects
inferred← citeshttps://doi.org/10.19153/cleiej.8.2.2openalex-snapshot
Convergence Through a Weak Consistency Model
inferred← citeshttps://doi.org/10.48550/arxiv.1310.7205openalex-snapshot
Algorithms for Timed Consistency Models
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9909015openalex-snapshot
A decision-theoretic approach to reliable message delivery
inferred← citeshttps://doi.org/10.5220/0001231801100116openalex-snapshot
DEVELOPING A WEB CACHING ARCHITECTURE WITH CONFIGURABLE CONSISTENCY: A PROPOSAL
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.