On the public citation graph

A simple model for agreement in distributed systems

https://doi.org/10.1007/bfb0042324
0 signed · 31 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/3-540-12689-9_99openalex-snapshot
The consensus problem in unreliable distributed systems (a brief survey)
inferredcites →https://doi.org/10.1007/bf01667080openalex-snapshot
Simulating authenticated broadcasts to derive simple fault-tolerant algorithms
inferredcites →https://doi.org/10.1007/bf01843568openalex-snapshot
Easy impossibility proofs for distributed consensus problems
inferredcites →https://doi.org/10.1016/0196-6774(82)90002-5openalex-snapshot
Lower bounds for algebraic decision trees
inferredcites →https://doi.org/10.1016/0196-6774(82)90004-9openalex-snapshot
The Byzantine generals strike again
inferredcites →https://doi.org/10.1016/s0019-9958(82)90776-8openalex-snapshot
An efficient algorithm for byzantine agreement without authentication
inferredcites →https://doi.org/10.1137/0212045openalex-snapshot
Authenticated Algorithms for Byzantine Agreement
inferredcites →https://doi.org/10.1137/0216031openalex-snapshot
Fast Distributed Agreement
inferredcites →https://doi.org/10.1145/10590.10596openalex-snapshot
A communication-efficient canonical form for fault-tolerant distributed protocols
inferredcites →https://doi.org/10.1145/190.357399openalex-snapshot
Byzantine generals in action
inferredcites →https://doi.org/10.1145/2402.322398openalex-snapshot
The Weak Byzantine Generals Problem
inferredcites →https://doi.org/10.1145/322186.322188openalex-snapshot
Reaching Agreement in the Presence of Faults
inferredcites →https://doi.org/10.1145/323596.323618openalex-snapshot
Inexact agreement
inferredcites →https://doi.org/10.1145/3335772.3335936openalex-snapshot
The Byzantine generals problem
inferredcites →https://doi.org/10.1145/357172.357176openalex-snapshot
The Byzantine Generals Problem
inferredcites →https://doi.org/10.1145/5925.5931openalex-snapshot
Reaching approximate agreement in the presence of faults
inferredcites →https://doi.org/10.1145/800221.806712openalex-snapshot
Method for distributed transaction commit and recovery using Byzantine Agreement within clusters of processors
inferredcites →https://doi.org/10.1145/800222.806739openalex-snapshot
Fault-tolerant clock synchronization
inferredcites →https://doi.org/10.1145/96559.96565openalex-snapshot
Early stopping in Byzantine agreement

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-36087-5_109openalex-snapshot
The Weakest Failure Detector for Solving Election Problems in Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.1007/3-540-44860-8_19openalex-snapshot
About the Relationship between Election Problem and Failure Detector in Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.1007/3-540-45785-2_22openalex-snapshot
Analysis of an Election Problem for CSCW in Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-39425-9_23openalex-snapshot
A Probabilistically Correct Election Protocol in Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-04761-9_24openalex-snapshot
Synthesis of Fault-Tolerant Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-33078-0_29openalex-snapshot
Non-Blocking Atomic Commitment in Asynchronous Distributed Systems with Faulty Processes
inferred← citeshttps://doi.org/10.1007/bfb0022140openalex-snapshot
Revisiting the relationship between non-blocking atomic commitment and consensus
inferred← citeshttps://doi.org/10.1016/s0169-023x(03)00019-3openalex-snapshot
A conceptual model for increasing utilization of dependable computer networks
inferred← citeshttps://doi.org/10.1109/itng.2011.168openalex-snapshot
Notice of Violation of IEEE Publication Principles: A stable election protocol based on an unreliable failure detector in distributed systems
inferred← citeshttps://doi.org/10.2168/lmcs-11(3:12)2015openalex-snapshot
Detecting Unrealizability of Distributed Fault-tolerant Systems
inferred← citeshttps://doi.org/10.5392/ijoc.2011.7.4.030openalex-snapshot
On Relationship between Safety and Liveness of Election Problem in Asynchronous Distributed Systems
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.