On the public citation graph

Cheaper matrix clocks

https://doi.org/10.1007/bfb0020445
0 signed · 29 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.1006/inco.1995.1060openalex-snapshot
Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement
inferredcites →https://doi.org/10.1007/bf02252679openalex-snapshot
Concurrent common knowledge: defining agreement for asynchronous systems
inferredcites →https://doi.org/10.1007/bfb0020445openalex-snapshot
Cheaper matrix clocks
inferredcites →https://doi.org/10.1016/0020-0255(89)90023-6openalex-snapshot
Two phase gossip: Managing distributed event histories
inferredcites →https://doi.org/10.1109/12.142678openalex-snapshot
Manetho: transparent roll back-recovery with low overhead, limited rollback, and fast output commit
inferredcites →https://doi.org/10.1109/2.84874openalex-snapshot
Logical time in distributed computing systems
inferredcites →https://doi.org/10.1109/ftcs.1988.5295openalex-snapshot
Volatile logging in n-fault-tolerant distributed systems
inferredcites →https://doi.org/10.1109/ftcsh.1995.532668openalex-snapshot
ATOMIC BROADCAST: FROM SIMPLE MESSAGE DIFFUSION TO BYZANTINE AGREEMENT
inferredcites →https://doi.org/10.1109/tse.1987.232564openalex-snapshot
Discarding Obsolete Information in a Replicated Database System
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/113413.113419openalex-snapshot
Bounded ignorance in replicated systems
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/3959.3962openalex-snapshot
Optimistic recovery in distributed systems
inferredcites →https://doi.org/10.1145/800222.806750openalex-snapshot
Efficient solutions to the replicated log and dictionary problems
inferredcites →https://doi.org/10.21236/ada229264openalex-snapshot
Highly-Available Distributed Services and Fault-Tolerant Distributed Garbage Collection

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11864219_19openalex-snapshot
Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data
inferred← citeshttps://doi.org/10.1007/3-540-36569-9_45openalex-snapshot
ROS: The Rollback-One-Step Method to Minimize the Waiting Time during Debugging Long-Running Parallel Programs
inferred← citeshttps://doi.org/10.1007/3-540-61772-8_48openalex-snapshot
Efficient message logging for uncoordinated checkpointing protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-30186-8_8openalex-snapshot
Bounded Version Vectors
inferred← citeshttps://doi.org/10.1007/s00446-003-0105-9openalex-snapshot
The power of logical clock abstractions
inferred← citeshttps://doi.org/10.1016/s0167-8191(03)00066-8openalex-snapshot
On reducing the complexity of matrix clocks
inferred← citeshttps://doi.org/10.1109/colcom.2006.361837openalex-snapshot
Using distributed consistent branching for efficient reconciliation of mobile workspaces
inferred← citeshttps://doi.org/10.1109/colcom.2006.361860openalex-snapshot
Using distributed consistent branching for efficient reconciliation of mobile workspaces
inferred← citeshttps://doi.org/10.1109/icccn54977.2022.9868846openalex-snapshot
Engage: Session Guarantees for the Edge
inferred← citeshttps://doi.org/10.1109/icdcs.1998.679490openalex-snapshot
An adaptive protocol for implementing causally consistent distributed services
inferred← citeshttps://doi.org/10.1109/seaa.2011.47openalex-snapshot
A Model-Based Approach for Reconciliation of Polychronous Execution Traces
inferred← citeshttps://doi.org/10.48550/arxiv.1907.07010openalex-snapshot
Threshold Logical Clocks for Asynchronous Distributed Coordination and Consensus
inferred← citeshttps://doi.org/10.48550/arxiv.2003.02291openalex-snapshot
Que Sera Consensus: Simple Asynchronous Agreement with Private Coins and Threshold Logical Clocks
showing the first 13 of 14 · page through all 14
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.