On the public citation graph
Message-optimal protocols for Byzantine Agreement
0 signed · 81 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/3-540-56188-9_15openalex-snapshot
Optimal early stopping in distributed consensus
inferredcites →https://doi.org/10.1007/bf01667080openalex-snapshot
Simulating authenticated broadcasts to derive simple fault-tolerant algorithms
inferredcites →https://doi.org/10.1007/bf02277665openalex-snapshot
On the message complexity of binary byzantine agreement under crash failures
inferredcites →https://doi.org/10.1007/bfb0042336openalex-snapshot
On the relationship between the atomic commitment and 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(90)90019-bopenalex-snapshot
Automatically increasing the fault-tolerance of distributed algorithms
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/fscs.1990.89524openalex-snapshot
Are wait-free algorithms fast?
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.1145/2455.214112openalex-snapshot
Bounds on information exchange for Byzantine agreement
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/72981.72982openalex-snapshot
A hundred impossibility proofs for distributed computing
inferredcites →https://doi.org/10.1145/79147.79161openalex-snapshot
Knowledge and common knowledge in a distributed environment
inferredcites →https://doi.org/10.1145/800221.806707openalex-snapshot
Another advantage of free choice (Extended Abstract)
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/11605805_22openalex-snapshot
A Round and Communication Efficient Secure Ranking Protocol
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-44448-3_12openalex-snapshot
Efficient Secure Multi-party Computation
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/3-540-68530-8_23openalex-snapshot
Adaptability and the Usefulness of Hints (Extended Abstract)
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-030-31277-0_2openalex-snapshot
On the Complexity of Fault-Tolerant Consensus
inferred← citeshttps://doi.org/10.1007/978-3-031-01877-0openalex-snapshot
Fault-Tolerant Distributed Transactions on Blockchain
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/978-3-642-15763-9_24openalex-snapshot
Scalable Quantum Consensus for Crash Failures
inferred← citeshttps://doi.org/10.1007/978-3-642-15763-9_42openalex-snapshot
Beyond Lamport’s Happened-Before: On the Role of Time Bounds in Synchronous Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-25873-2_14openalex-snapshot
Communication Complexity of Consensus in Anonymous Message Passing Systems
inferred← citeshttps://doi.org/10.1007/bf01187076openalex-snapshot
Modular construction of an efficient 1-bit Byzantine agreement protocol
inferred← citeshttps://doi.org/10.1007/bf02277665openalex-snapshot
On the message complexity of binary byzantine agreement under crash failures
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-004-0108-1openalex-snapshot
Using counterfactuals in knowledge-based programming
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.1007/s004460050012openalex-snapshot
Optimal time byzantine agreement for t
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.08.001openalex-snapshot
Robust gossiping with an application to consensus
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114888openalex-snapshot
Sublinear message bounds of authenticated implicit Byzantine agreement
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/broadnets.2006.4374344openalex-snapshot
How to Specify and How to Prove Correctness of Secure Routing Protocols for MANET
inferred← citeshttps://doi.org/10.1109/ftcs.1993.627358openalex-snapshot
Byzantine agreement with a minimum number of messages both in the faultless and worst case
inferred← citeshttps://doi.org/10.1109/ftcs.1995.466996openalex-snapshot
Fault tolerance in safety critical automotive applications: cost of agreement as a limiting factor
inferred← citeshttps://doi.org/10.1109/icdcs.1992.235012openalex-snapshot
Efficient decentralized consensus protocols in a distributed computing system
inferred← citeshttps://doi.org/10.1109/icdcs.1993.287690openalex-snapshot
Decentralized consensus protocols with multi-port communication
inferred← citeshttps://doi.org/10.1109/icdcs.1995.500005openalex-snapshot
Efficient failure discovery with limited authentication
inferred← citeshttps://doi.org/10.1109/isit.1994.395025openalex-snapshot
Message-optimal protocols for reliable broadcasts in networks with crash failures
inferred← citeshttps://doi.org/10.1109/pdis.1991.183111openalex-snapshot
Optimal all-to-all broadcasting schemes in distributed systems
inferred← citeshttps://doi.org/10.1109/sarnof.2005.1426537openalex-snapshot
Secure on-demand distance vector routing in ad hoc networks
inferred← citeshttps://doi.org/10.1109/sarnof.2005.1426539openalex-snapshot
Secure route discovery for QoS-aware routing in ad hoc networks
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492674openalex-snapshot
Resolving message complexity of Byzantine Agreement and beyond
inferred← citeshttps://doi.org/10.1109/tpds.2002.1028435openalex-snapshot
On the asymptotical optimality of multilayered decentralized consensus protocol
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/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/2484239.2484269openalex-snapshot
Early-deciding consensus is expensive
inferred← citeshttps://doi.org/10.1145/3382734.3405717openalex-snapshot
Brief Announcement: On Using Null Messages in a Byzantine Setting
inferred← citeshttps://doi.org/10.1145/3583668.3594599openalex-snapshot
Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication
inferred← citeshttps://doi.org/10.1145/3583668.3594600openalex-snapshot
Brief Announcement: Improved Consensus in Quantum Networks
inferred← citeshttps://doi.org/10.1145/3631461.3631548openalex-snapshot
Sublinear Message Bounds of Authenticated Implicit Byzantine Agreement
inferred← citeshttps://doi.org/10.1145/3732772.3733509openalex-snapshot
Quantum Communication Advantage for Leader Election and Agreement
inferred← citeshttps://doi.org/10.1145/3732772.3733553openalex-snapshot
Improved Byzantine Agreement under an Adaptive Adversary
inferred← citeshttps://doi.org/10.1201/9781420067125-c5openalex-snapshot
A Survey of Fault Tolerance in Ad-Hoc Networks and Sensor Networks
inferred← citeshttps://doi.org/10.14198/fem.2022.40.03openalex-snapshot
African Diasporic Connections in the Americas: Toni Morrison in Brazil
inferred← citeshttps://doi.org/10.2200/s01068ed1v01y202012dtm065openalex-snapshot
Fault-Tolerant Distributed Transactions on Blockchain
inferred← citeshttps://doi.org/10.3233/fi-2015-1181openalex-snapshot
Communication Complexity of Consensus in Anonymous Message Passing Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1112.4428openalex-snapshot
Causality, Knowledge and Coordination in Distributed Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1905.06087openalex-snapshot
Byzantine Consensus in the Common Case
inferred← citeshttps://doi.org/10.48550/arxiv.2105.07123openalex-snapshot
Byzantine-Resilient Population Protocols
inferred← citeshttps://doi.org/10.70675/b441c3a1zf42cz4cd7z8594z7121c5089d1fopenalex-snapshot
Consensus Byzantin et blockchain : Modèles unifiés et nouveaux protocoles
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.