On the public citation graph
On the message complexity of binary byzantine agreement under crash failures
0 signed · 37 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/3-540-12689-9_99openalex-snapshot
The consensus problem in unreliable distributed systems (a brief survey)
inferredcites →https://doi.org/10.1007/bf01187074openalex-snapshot
Message-optimal protocols for Byzantine Agreement
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/b978-0-934613-04-0.50013-2openalex-snapshot
Knowledge and Common Knowledge in a Byzantine Environment I: Crash failures
inferredcites →https://doi.org/10.1109/sfcs.1985.14openalex-snapshot
Byzantine agreement in constant expected time
inferredcites →https://doi.org/10.1109/sfcs.1989.63511openalex-snapshot
Towards optimal distributed consensus
inferredcites →https://doi.org/10.1137/0212045openalex-snapshot
Authenticated Algorithms for Byzantine Agreement
inferredcites →https://doi.org/10.1137/0215006openalex-snapshot
Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
inferredcites →https://doi.org/10.1145/112600.112626openalex-snapshot
Message-optimal protocols for byzantine agreement (extended abstract)
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/72981.72982openalex-snapshot
A hundred impossibility proofs for distributed computing
inferredcites →https://doi.org/10.1145/800220.806690openalex-snapshot
Bounds on information exchange for 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/11864219_22openalex-snapshot
Time and Communication Efficient Consensus for Crash Failures
inferred← citeshttps://doi.org/10.1007/3-540-54099-7_20openalex-snapshot
Time and message efficient reliable broadcasts
inferred← citeshttps://doi.org/10.1007/978-3-030-31277-0_2openalex-snapshot
On the Complexity of Fault-Tolerant Consensus
inferred← citeshttps://doi.org/10.1007/978-3-030-54921-3_17openalex-snapshot
Communication Complexity of Wait-Free Computability in Dynamic Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-57853-3_7openalex-snapshot
Adaptive Consensus: Enhancing Robustness in Dynamic Environments
inferred← citeshttps://doi.org/10.1007/978-3-540-75142-7_23openalex-snapshot
On the Message Complexity of Indulgent Consensus
inferred← citeshttps://doi.org/10.1007/bf01187074openalex-snapshot
Message-optimal protocols for Byzantine Agreement
inferred← citeshttps://doi.org/10.1007/s00446-003-0091-yopenalex-snapshot
Hundreds of impossibility results for distributed computing
inferred← citeshttps://doi.org/10.1007/s00446-021-00393-8openalex-snapshot
Optimistically tuning synchronous byzantine consensus: another win for null messages
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.08.001openalex-snapshot
Robust gossiping with an application to consensus
inferred← citeshttps://doi.org/10.1109/12.364545openalex-snapshot
Message-optimal protocols for fault-tolerant broadcasts/multicasts in distributed systems with crash failures
inferred← citeshttps://doi.org/10.1109/49.414647openalex-snapshot
On the message and time complexity of protocols for reliable broadcasts/multicasts in networks with omission failures
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492674openalex-snapshot
Resolving message complexity of Byzantine Agreement and beyond
inferred← citeshttps://doi.org/10.1109/tc.2024.3506856openalex-snapshot
Nicaea: A Byzantine Fault Tolerant Consensus Under Unpredictable Message Delivery Failures for Parallel and Distributed Computing
inferred← citeshttps://doi.org/10.1145/112600.112626openalex-snapshot
Message-optimal protocols for byzantine agreement (extended abstract)
inferred← citeshttps://doi.org/10.1145/1582716.1582738openalex-snapshot
Fast scalable deterministic consensus for crash failures
inferred← citeshttps://doi.org/10.1145/1583991.1584063openalex-snapshot
Locally scalable randomized consensus for synchronous crash failures
inferred← citeshttps://doi.org/10.1145/197917.198082openalex-snapshot
Time-optimal message-efficient work performance in the presence of faults
inferred← citeshttps://doi.org/10.1145/3055386.3055389openalex-snapshot
Privacy Friendly Aggregation of Smart Meter Readings, Even When Meters Crash
inferred← citeshttps://doi.org/10.1145/3519935.3520078openalex-snapshot
Improved communication complexity of fault-tolerant consensus
inferred← citeshttps://doi.org/10.48550/arxiv.1905.06087openalex-snapshot
Byzantine Consensus in the Common Case
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.