On the public citation graph

A self-adjusting algorithm for byzantine agreement

https://doi.org/10.1007/bf02277668
0 signed · 35 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/bf01667080openalex-snapshot
Simulating authenticated broadcasts to derive simple fault-tolerant algorithms
inferredcites →https://doi.org/10.1007/bf02278854openalex-snapshot
Stabilization and pseudo-stabilization
inferredcites →https://doi.org/10.1016/0020-0190(82)90033-3openalex-snapshot
A lower bound for the time to assure interactive consistency
inferredcites →https://doi.org/10.1016/0020-0190(84)90027-9openalex-snapshot
Extending binary Byzantine agreement to multivalued Byzantine agreement
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.1109/sfcs.1982.51openalex-snapshot
'Eventual' is earlier than 'immediate'
inferredcites →https://doi.org/10.1109/sfcs.1983.48openalex-snapshot
Randomized byzantine generals
inferredcites →https://doi.org/10.1109/tse.1985.232245openalex-snapshot
A Simple and Efficient Randomized Byzantine Agreement Algorithm
inferredcites →https://doi.org/10.1109/tse.1985.232246openalex-snapshot
Randomized 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/10590.10597openalex-snapshot
Asymptotically optimal algorithms for approximate agreement
inferredcites →https://doi.org/10.1145/2455.214112openalex-snapshot
Bounds on information exchange for Byzantine agreement
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/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
inferredcites →https://doi.org/10.1145/5925.5931openalex-snapshot
Reaching approximate agreement in the presence of faults
inferredcites →https://doi.org/10.1145/800070.802215openalex-snapshot
Polynomial algorithms for multiple processor agreement
inferredcites →https://doi.org/10.1145/800222.806744openalex-snapshot
Randomized Byzantine Agreements
inferredcites →https://doi.org/10.21236/ada113241openalex-snapshot
A Simple and Efficient Byzantine Generals Algorithm.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-642-16023-3_12openalex-snapshot
Adaptive Containment of Time-Bounded Byzantine Faults
inferred← citeshttps://doi.org/10.1007/bfb0058030openalex-snapshot
Compositional design of multitolerant repetitive byzantine agreement
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00026-9openalex-snapshot
A highly safe self-stabilizing mutual exclusion algorithm
inferred← citeshttps://doi.org/10.1109/32.256850openalex-snapshot
Closure and convergence: a foundation of fault-tolerant computing
inferred← citeshttps://doi.org/10.1109/apads.1993.588870openalex-snapshot
Robust coordination in distributed multi-server systems
inferred← citeshttps://doi.org/10.1109/ftcs.1995.466988openalex-snapshot
Self-stabilizing mutual exclusion in the presence of faulty nodes
inferred← citeshttps://doi.org/10.1109/iccci50826.2021.9402318openalex-snapshot
A Study on Distributed Consensus Protocols and Algorithms: The Backbone of Blockchain Networks
inferred← citeshttps://doi.org/10.1109/icsai57119.2022.10005475openalex-snapshot
Byzantine Consensus Based on Modified Treap Topology
inferred← citeshttps://doi.org/10.1109/isads.1993.262694openalex-snapshot
Inherent fault tolerance in decentralized process-control systems
inferred← citeshttps://doi.org/10.1109/reldis.1994.336913openalex-snapshot
A methodology for constructing a stabilizing crash-tolerant application
inferred← citeshttps://doi.org/10.1109/reldis.2001.969767openalex-snapshot
Polynomial time synthesis of Byzantine agreement
inferred← citeshttps://doi.org/10.1515/9780773591141-002openalex-snapshot
Compositional Design of Multitolerant Repetitive Byzantine Agreement
inferred← citeshttps://doi.org/10.21236/ada603092openalex-snapshot
Performance of Wireless Networks Subject to Constraints and Failures
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.