On the public citation graph
Asymptotically optimal distributed consensus
0 signed · 69 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.1016/0010-4485(85)90134-4openalex-snapshot
Computational aspects of VLSI
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/12130.12169openalex-snapshot
Fault tolerance in networks of bounded degree
inferredcites →https://doi.org/10.1145/41840.41844openalex-snapshot
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
inferredcites →https://doi.org/10.1145/800070.802215openalex-snapshot
Polynomial algorithms for multiple processor agreement
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-36108-1_15openalex-snapshot
Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes
inferred← citeshttps://doi.org/10.1007/3-540-39200-9_4openalex-snapshot
Two-Threshold Broadcast and Detectable Multi-party Computation
inferred← citeshttps://doi.org/10.1007/3-540-54099-7_22openalex-snapshot
Fast consensus in networks of bounded degree
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-1-4612-4476-9_36openalex-snapshot
A Simple Proof of a Simple Consensus Algorithm
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-04612-5_22openalex-snapshot
Byzantine Preferential Voting
inferred← citeshttps://doi.org/10.1007/978-3-030-17465-1_20openalex-snapshot
Verifying Safety of Synchronous Fault-Tolerant Algorithms by Bounded Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-45724-2_6openalex-snapshot
Efficient Constructions for Almost-Everywhere Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-50086-3_11openalex-snapshot
Tutorial: Parameterized Verification with Byzantine Model Checker
inferred← citeshttps://doi.org/10.1007/978-3-030-67067-2_10openalex-snapshot
Eliminating Message Counters in Synchronous Threshold Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-07535-3_12openalex-snapshot
Formal Verification of Blockchain Byzantine Fault Tolerance
inferred← citeshttps://doi.org/10.1007/978-3-031-58734-4_4openalex-snapshot
Proof-of-Work-Based Consensus in Expected-Constant Time
inferred← citeshttps://doi.org/10.1007/978-3-032-01878-6_1openalex-snapshot
State Machine Replication Among Strangers, Fast and Self-sufficient
inferred← citeshttps://doi.org/10.1007/978-3-540-30186-8_32openalex-snapshot
On Byzantine Agreement over (2,3)-Uniform Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-10877-8_12openalex-snapshot
Enhanced Fault-Tolerance through Byzantine Failure Detection
inferred← citeshttps://doi.org/10.1007/978-3-642-14162-1_21openalex-snapshot
Improved Fault Tolerance and Secure Computation on Sparse Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-25873-2_32openalex-snapshot
Accurate Byzantine Agreement with Feedback
inferred← citeshttps://doi.org/10.1007/bf01187072openalex-snapshot
Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
inferred← citeshttps://doi.org/10.1007/bf01798957openalex-snapshot
Consensus algorithms with one-bit messages
inferred← citeshttps://doi.org/10.1007/bf02280836openalex-snapshot
Fast consensus in networks of bounded degree
inferred← citeshttps://doi.org/10.1007/bfb0020438openalex-snapshot
Reaching (and maintaining) agreement in the presence of mobile faults
inferred← citeshttps://doi.org/10.1007/bfb0022440openalex-snapshot
Optimal amortized distributed consensus
inferred← citeshttps://doi.org/10.1007/bfb0022441openalex-snapshot
Optimally simulating crash failures in a byzantine environment
inferred← citeshttps://doi.org/10.1007/s00446-005-0125-8openalex-snapshot
Tight bounds for shared memory systems accessed by Byzantine processes
inferred← citeshttps://doi.org/10.1007/s11227-014-1291-xopenalex-snapshot
The $$k$$ k -Set consensus problem with weight consideration
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90182-8openalex-snapshot
A simple proof of a simple consensus algorithm
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00015-4openalex-snapshot
Agreement in the presence of faults, on networks of bounded degree
inferred← citeshttps://doi.org/10.1016/0026-2714(91)90005-ropenalex-snapshot
Modelling solutions for agreement problems with PrT-nets
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.dam.2020.10.022openalex-snapshot
Optimal strategies for selecting coordinators
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.1016/j.tcs.2010.09.032openalex-snapshot
Synchronous consensus under hybrid process and link failures
inferred← citeshttps://doi.org/10.1109/access.2022.3175998openalex-snapshot
Reaching Efficient Byzantine Agreements in Bipartite Networks
inferred← citeshttps://doi.org/10.1109/dsd.2013.97openalex-snapshot
Efficient Construction of Global Time in SoCs Despite Arbitrary Faults
inferred← citeshttps://doi.org/10.1109/focs.2006.77openalex-snapshot
Towards Secure and Scalable Computation in Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.1109/ftcs.1995.466995openalex-snapshot
Optimal resiliency against mobile faults
inferred← citeshttps://doi.org/10.1109/icpads.2000.857709openalex-snapshot
Circumventing/identifying faults effects
inferred← citeshttps://doi.org/10.1109/icpads53394.2021.00097openalex-snapshot
Boosting Byzantine Protocols in Large Sparse Networks with High System Assumption Coverage
inferred← citeshttps://doi.org/10.1109/icpads53394.2021.00098openalex-snapshot
Simulating Authenticated Broadcast in Networks of Bounded Degree
inferred← citeshttps://doi.org/10.1109/ipdps.2011.57openalex-snapshot
The Weighted Byzantine Agreement Problem
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63511openalex-snapshot
Towards optimal distributed consensus
inferred← citeshttps://doi.org/10.1109/srds.2018.00036openalex-snapshot
Byzantine Agreement with Interval Validity
inferred← citeshttps://doi.org/10.1109/surv.2011.041311.00156openalex-snapshot
Overcoming Adversaries in Sensor Networks: A Survey of Theoretical Models and Algorithmic Approaches for Tolerating Malicious Interference
inferred← citeshttps://doi.org/10.1137/s009753970443999xopenalex-snapshot
Impossibility Results and Lower Bounds for Consensus under Link Failures
inferred← citeshttps://doi.org/10.1145/1132516.1132543openalex-snapshot
Byzantine agreement in the full-information model in O(log n) rounds
inferred← citeshttps://doi.org/10.1145/1146381.1146420openalex-snapshot
Reliable broadcast in radio networks
inferred← citeshttps://doi.org/10.1145/135419.135437openalex-snapshot
Tolerating linear number of faults in networks of bounded degree
inferred← citeshttps://doi.org/10.1145/1993806.1993840openalex-snapshot
Accurate byzantine agreement with feedback
inferred← citeshttps://doi.org/10.1145/3465084.3467953openalex-snapshot
Brief Announcement: Malicious Security Comes for Free in Consensus with Leaders
inferred← citeshttps://doi.org/10.1145/72981.73002openalex-snapshot
Modular construction of nearly optimal Byzantine agreement protocols
inferred← citeshttps://doi.org/10.1145/872035.872065openalex-snapshot
Distributed consensus in the presence of sectional faults
inferred← citeshttps://doi.org/10.1145/872035.872066openalex-snapshot
Efficient player-optimal protocols for strong and differential consensus
inferred← citeshttps://doi.org/10.1186/s42400-025-00501-2openalex-snapshot
Survey of Consensus Protocol’s Formal Verification
inferred← citeshttps://doi.org/10.46298/lmcs-19(1:5)2023openalex-snapshot
Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
inferred← citeshttps://doi.org/10.48550/arxiv.1705.07231openalex-snapshot
Adapting Low-Cost Platforms for Robotics Research
inferred← citeshttps://doi.org/10.48550/arxiv.1803.02720openalex-snapshot
Byzantine Preferential Voting
inferred← citeshttps://doi.org/10.5075/epfl-thesis-4839openalex-snapshot
Round-Based Consensus Algorithms, Predicate Implementations and Quantitative Analysis
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.