On the public citation graph

Total ordering algorithms for asynchronous Byzantine systems

https://doi.org/10.1007/bfb0022151
0 signed · 30 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.1101openalex-snapshot
Optimal Amortized Distributed Consensus
inferredcites →https://doi.org/10.1007/3-540-56188-9_11openalex-snapshot
A continuum of failure models for distributed computing
inferredcites →https://doi.org/10.1007/3-540-56188-9_12openalex-snapshot
Simulating crash failures with many faulty processors (extended abstract)
inferredcites →https://doi.org/10.1007/bf01798957openalex-snapshot
Consensus algorithms with one-bit messages
inferredcites →https://doi.org/10.1016/0890-5401(87)90054-xopenalex-snapshot
Asynchronous Byzantine agreement protocols
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/71.89066openalex-snapshot
Consensus with dual failure modes
inferredcites →https://doi.org/10.1109/reldis.1988.25784openalex-snapshot
Interactive consistency with multiple failure modes
inferredcites →https://doi.org/10.1109/sfcs.1983.48openalex-snapshot
Randomized byzantine generals
inferredcites →https://doi.org/10.1137/0216031openalex-snapshot
Fast Distributed Agreement
inferredcites →https://doi.org/10.1137/0222048openalex-snapshot
Asynchronous Fault-Tolerant Total Ordering Algorithms
inferredcites →https://doi.org/10.1145/112600.112627openalex-snapshot
Unreliable failure detectors for asynchronous systems (preliminary version)
inferredcites →https://doi.org/10.1145/135419.135451openalex-snapshot
The weakest failure detector for solving consensus
inferredcites →https://doi.org/10.1145/190.357399openalex-snapshot
Byzantine generals in action
inferredcites →https://doi.org/10.1145/234533.234549openalex-snapshot
The weakest failure detector for solving consensus
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/322186.322188openalex-snapshot
Reaching Agreement in the Presence of Faults
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/4221.214134openalex-snapshot
Asynchronous consensus and broadcast protocols
inferredcites →https://doi.org/10.1145/800221.806707openalex-snapshot
Another advantage of free choice (Extended Abstract)

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-45414-4_5openalex-snapshot
Optimal Unconditional Information Diffusion
inferred← citeshttps://doi.org/10.1007/s004460050002openalex-snapshot
Secure reliable multicast protocols in a WAN
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00325-0openalex-snapshot
Diffusion without false rumors: on propagating updates in a Byzantine environment
inferred← citeshttps://doi.org/10.1109/csfw.1996.503686openalex-snapshot
A high-throughput secure reliable multicast protocol
inferred← citeshttps://doi.org/10.1109/hicss.1998.656294openalex-snapshot
The SecureRing protocols for securing group communication
inferred← citeshttps://doi.org/10.1109/icdcs.1997.597857openalex-snapshot
Secure reliable multicast protocols in a WAN
inferred← citeshttps://doi.org/10.1109/reldis.1999.805090openalex-snapshot
On diffusing updates in a Byzantine environment
inferred← citeshttps://doi.org/10.1109/reldis.2001.969758openalex-snapshot
Efficient update diffusion in byzantine environments
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9908008openalex-snapshot
Secure Multicast in a WAN
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9908010openalex-snapshot
On Propagating Updates in a Byzantine Environment
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.