On the public citation graph
Efficient agreement using fault diagnosis
0 signed · 39 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01187072openalex-snapshot
Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
inferredcites →https://doi.org/10.1007/bf01187076openalex-snapshot
Modular construction of an efficient 1-bit Byzantine agreement protocol
inferredcites →https://doi.org/10.1007/bf01667080openalex-snapshot
Simulating authenticated broadcasts to derive simple fault-tolerant algorithms
inferredcites →https://doi.org/10.1007/bf01667081openalex-snapshot
Connectivity requirements for Byzantine agreement under restricted types of failures
inferredcites →https://doi.org/10.1007/bf01798957openalex-snapshot
Consensus algorithms with one-bit messages
inferredcites →https://doi.org/10.1007/bf01843568openalex-snapshot
Easy impossibility proofs for distributed consensus problems
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/0196-6774(82)90004-9openalex-snapshot
The Byzantine generals strike again
inferredcites →https://doi.org/10.1016/0890-5401(92)90004-yopenalex-snapshot
Modular construction of a Byzantine agreement protocol with optimal message bit complexity
inferredcites →https://doi.org/10.1016/0890-5401(92)90035-eopenalex-snapshot
Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
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.1016/s0019-9958(85)80042-5openalex-snapshot
A new solution for the Byzantine generals problem
inferredcites →https://doi.org/10.1109/sfcs.1988.21941openalex-snapshot
Coordinated traversal: (t+1)-round Byzantine agreement in polynomial time
inferredcites →https://doi.org/10.1109/sfcs.1989.63511openalex-snapshot
Towards optimal distributed consensus
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/167088.167101openalex-snapshot
Fully polynomial Byzantine agreement in t + 1 rounds
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/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-54099-7_21openalex-snapshot
Early-stopping distributed bidding and applications
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/3-540-56188-9_15openalex-snapshot
Optimal early stopping in distributed consensus
inferred← citeshttps://doi.org/10.1007/978-3-030-17277-0_11openalex-snapshot
Redundancy as a Measure of Fault-Tolerance for the Internet of Things: A Review
inferred← citeshttps://doi.org/10.1007/978-3-031-91092-0_5openalex-snapshot
Asymptotically Optimal Early Termination for Dishonest Majority Broadcast
inferred← citeshttps://doi.org/10.1007/bf01187072openalex-snapshot
Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
inferred← citeshttps://doi.org/10.1007/bf01187076openalex-snapshot
Modular construction of an efficient 1-bit Byzantine agreement protocol
inferred← citeshttps://doi.org/10.1007/bf02280828openalex-snapshot
Fast and simple distributed consensus
inferred← citeshttps://doi.org/10.1007/s004460050012openalex-snapshot
Optimal time byzantine agreement for t
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90004-yopenalex-snapshot
Modular construction of a Byzantine agreement protocol with optimal message bit complexity
inferred← citeshttps://doi.org/10.1016/j.ins.2003.03.004openalex-snapshot
A flexible formal framework for masking/demasking faults
inferred← citeshttps://doi.org/10.1109/hicss.1999.772983openalex-snapshot
The Byzantine agreement problem: optimal early stopping
inferred← citeshttps://doi.org/10.1109/icpads.2000.857709openalex-snapshot
Circumventing/identifying faults effects
inferred← citeshttps://doi.org/10.1137/s0097539794265232openalex-snapshot
Fully Polynomial Byzantine Agreement for n > 3 t Processors in t + 1 Rounds
inferred← citeshttps://doi.org/10.1145/152610.152612openalex-snapshot
The consensus problem in fault-tolerant computing
inferred← citeshttps://doi.org/10.1145/248052.248091openalex-snapshot
An randomized Byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time
inferred← citeshttps://doi.org/10.1145/3519270.3538471openalex-snapshot
Brief Announcement: Deterministic Consensus and Checkpointing with Crashes: Time and Communication Efficiency
inferred← citeshttps://doi.org/10.1145/3583668.3594599openalex-snapshot
Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication
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.