On the public citation graph

Families of consensus algorithms

https://doi.org/10.1007/bfb0040405
0 signed · 22 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.1137/0212045openalex-snapshot
Authenticated Algorithms for Byzantine 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/322186.322188openalex-snapshot
Reaching Agreement in the Presence of Faults
inferredcites →https://doi.org/10.1145/41840.41844openalex-snapshot
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
inferredcites →https://doi.org/10.1145/800070.802214openalex-snapshot
Cryptographic protocols

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-54099-7_22openalex-snapshot
Fast consensus in networks of bounded degree
inferred← citeshttps://doi.org/10.1007/3-540-56188-9_10openalex-snapshot
Optimal time Byzantine agreement for t < n/8 with linear messages
inferred← citeshttps://doi.org/10.1007/978-1-4615-3422-8_27openalex-snapshot
Bit Optimal Distributed Consensus
inferred← citeshttps://doi.org/10.1007/978-3-032-11127-2_10openalex-snapshot
Centroid Approximation with Multidimensional Approximate Agreement Protocols
inferred← citeshttps://doi.org/10.1007/bf01187072openalex-snapshot
Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
inferred← citeshttps://doi.org/10.1007/bf01783661openalex-snapshot
One-bit algorithms
inferred← citeshttps://doi.org/10.1007/bf02280836openalex-snapshot
Fast consensus in networks of bounded degree
inferred← citeshttps://doi.org/10.1007/bfb0022442openalex-snapshot
Efficient distributed consensus with n=(3 + ɛ)t processors
inferred← citeshttps://doi.org/10.1007/bfb0035753openalex-snapshot
Asymptotically optimal distributed consensus
inferred← citeshttps://doi.org/10.1007/s004460050012openalex-snapshot
Optimal time byzantine agreement for t
inferred← citeshttps://doi.org/10.1109/icpr.1988.28416openalex-snapshot
Robust multi-agent decision making in faulty environment
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63511openalex-snapshot
Towards optimal distributed consensus
inferred← citeshttps://doi.org/10.1137/0218068openalex-snapshot
The Distributed Firing Squad Problem
inferred← citeshttps://doi.org/10.1145/167088.167101openalex-snapshot
Fully polynomial Byzantine agreement in t + 1 rounds
inferred← citeshttps://doi.org/10.1145/2484239.2484271openalex-snapshot
Synchronous byzantine agreement with nearly a cubic number of communication bits
inferred← citeshttps://doi.org/10.1145/62546.62558openalex-snapshot
One bit algorithms
inferred← citeshttps://doi.org/10.3990/1.9789036510813openalex-snapshot
Classes of Byzantine Fault-Tolerant Algorithms for Dependable 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.