On the public citation graph
Easy impossibility proofs for distributed consensus problems
0 signed · 244 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/0196-6774(82)90004-9openalex-snapshot
The Byzantine generals strike again
inferredcites →https://doi.org/10.1109/sfcs.1981.41openalex-snapshot
Symmetry breaking in distributive networks
inferredcites →https://doi.org/10.1145/22145.22182openalex-snapshot
The distributed firing squad problem
inferredcites →https://doi.org/10.1145/2402.322398openalex-snapshot
The Weak Byzantine Generals Problem
inferredcites →https://doi.org/10.1145/322186.322188openalex-snapshot
Reaching Agreement in the Presence of Faults
inferredcites →https://doi.org/10.1145/5925.5931openalex-snapshot
Reaching approximate agreement in the presence of faults
inferredcites →https://doi.org/10.1145/800057.808720openalex-snapshot
On the possibility and impossibility of achieving clock synchronization
inferredcites →https://doi.org/10.21236/ada154770openalex-snapshot
The Byzantine Firing Squad Problem.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0470072644openalex-snapshot
Design and Analysis of Distributed Algorithms
inferred← citeshttps://doi.org/10.1002/1097-0142(19940201)73:3+<905::aid-cncr2820731324>3.0.co;2-kopenalex-snapshot
Radiation dosimetry for radioimmunotherapy. An overview of current capabilities and limitations
inferred← citeshttps://doi.org/10.1002/rsa.20992openalex-snapshot
Phase transitions of Best‐of‐two and Best‐of‐three on stochastic block models
inferred← citeshttps://doi.org/10.1002/rsa.21224openalex-snapshot
Quasi‐majority functional voting on expander graphs
inferred← citeshttps://doi.org/10.1006/eujc.1994.1015openalex-snapshot
Coverings and Minors: Application to Local Computations in Graphs
inferred← citeshttps://doi.org/10.1006/inco.1995.1056openalex-snapshot
On the Recognition of Families of Graphs with Local Computations
inferred← citeshttps://doi.org/10.1007/11429647_21openalex-snapshot
Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults
inferred← citeshttps://doi.org/10.1007/11429647_4openalex-snapshot
On Private Computation in Incomplete Networks
inferred← citeshttps://doi.org/10.1007/11577327_4openalex-snapshot
Self-stabilization of Byzantine Protocols
inferred← citeshttps://doi.org/10.1007/11776178_3openalex-snapshot
Stabilizing Consensus in Mobile Networks
inferred← citeshttps://doi.org/10.1007/3-540-36108-1_2openalex-snapshot
Secure Computation without Agreement
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-44647-8_5openalex-snapshot
Minimal Complete Primitives for Secure Multi-party Computation
inferred← citeshttps://doi.org/10.1007/3-540-45032-7_3openalex-snapshot
Self-Stabilizing Pulse Synchronization Inspired by Biological Pacemaker Networks
inferred← citeshttps://doi.org/10.1007/3-540-46035-7_32openalex-snapshot
Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch
inferred← citeshttps://doi.org/10.1007/3-540-56402-0_58openalex-snapshot
The power and the limitations of local computations on graphs
inferred← citeshttps://doi.org/10.1007/3-540-61064-2_25openalex-snapshot
The Kronecker product and local computations in graphs
inferred← citeshttps://doi.org/10.1007/3-7643-7394-6_2openalex-snapshot
Multiparty Computation, an Introduction
inferred← citeshttps://doi.org/10.1007/978-1-4471-2416-0_10openalex-snapshot
Overcoming Failures in a Distributed System
inferred← citeshttps://doi.org/10.1007/978-1-4471-2416-0_12openalex-snapshot
Group Communication Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-2416-0_15openalex-snapshot
Consistency in Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-03807-6_15openalex-snapshot
Oblivious Transfer in Incomplete Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-34992-9_5openalex-snapshot
Synchronous t-Resilient Consensus in Arbitrary Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-40186-3_13openalex-snapshot
SoK: A Consensus Taxonomy in the Blockchain Era
inferred← citeshttps://doi.org/10.1007/978-3-030-59635-4_2openalex-snapshot
Leveraging Federated Clouds for Improving Blockchain Performance
inferred← citeshttps://doi.org/10.1007/978-3-030-64378-2_22openalex-snapshot
On the Power of an Honest Majority in Three-Party Computation Without Broadcast
inferred← citeshttps://doi.org/10.1007/978-3-030-79527-6_6openalex-snapshot
Wait-Free Approximate Agreement on Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-79527-6_9openalex-snapshot
The Epigenetic Consensus Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-01807-7_2openalex-snapshot
A Consensus Taxonomy in the Blockchain Era
inferred← citeshttps://doi.org/10.1007/978-3-031-30617-4_19openalex-snapshot
Complete Characterization of Broadcast and Pseudo-signatures from Correlations
inferred← citeshttps://doi.org/10.1007/978-3-031-35260-7_1openalex-snapshot
TADA: A Toolkit for Approximate Distributed Agreement
inferred← citeshttps://doi.org/10.1007/978-3-031-37765-5_9openalex-snapshot
Consensus on an Unknown Torus with Dense Byzantine Faults
inferred← citeshttps://doi.org/10.1007/978-3-031-38557-5_1openalex-snapshot
Completeness Theorems for Adaptively Secure Broadcast
inferred← citeshttps://doi.org/10.1007/978-3-031-44274-2_16openalex-snapshot
Disconnected Agreement in Networks Prone to Link Failures
inferred← citeshttps://doi.org/10.1007/978-3-031-47754-6_4openalex-snapshot
Player-Replaceability and Forensic Support Are Two Sides of the Same (Crypto) Coin
inferred← citeshttps://doi.org/10.1007/978-3-031-48618-0_15openalex-snapshot
Memory Checking for Parallel RAMs
inferred← citeshttps://doi.org/10.1007/978-3-031-48618-0_4openalex-snapshot
On Secure Computation of Solitary Output Functionalities with and Without Broadcast
inferred← citeshttps://doi.org/10.1007/978-3-031-48624-1_16openalex-snapshot
Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited
inferred← citeshttps://doi.org/10.1007/978-3-031-60603-8_29openalex-snapshot
Network Abstractions for Characterizing Communication Requirements in Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-67321-4_17openalex-snapshot
BeRGeR: Byzantine-Robust Geometric Routing
inferred← citeshttps://doi.org/10.1007/978-3-031-71070-4_14openalex-snapshot
Scalable Agreement Protocols with Optimal Optimistic Efficiency
inferred← citeshttps://doi.org/10.1007/978-3-032-01884-7_10openalex-snapshot
Strong Secret Sharing with Snitching
inferred← citeshttps://doi.org/10.1007/978-3-032-12290-2_22openalex-snapshot
An Unstoppable Ideal Functionality for Signatures and a Modular Analysis of the Dolev-Strong Broadcast
inferred← citeshttps://doi.org/10.1007/978-3-032-25324-8_19openalex-snapshot
Maintaining Sublinear Locality Over Time: Adaptively Secure MPC on a Reusable Hidden Graph
inferred← citeshttps://doi.org/10.1007/978-3-319-03850-6_11openalex-snapshot
Hybrid Distributed Consensus
inferred← citeshttps://doi.org/10.1007/978-3-319-28183-4_7openalex-snapshot
Towards Predictable Vehicular Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-96878-0_9openalex-snapshot
Must the Communication Graph of MPC Protocols be an Expander?
inferred← citeshttps://doi.org/10.1007/978-3-540-24676-3_25openalex-snapshot
Multi-party Computation with Hybrid Security
inferred← citeshttps://doi.org/10.1007/978-3-540-27860-3_4openalex-snapshot
Linear Time Byzantine Self-Stabilizing Clock Synchronization
inferred← citeshttps://doi.org/10.1007/978-3-540-28628-8_34openalex-snapshot
Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness
inferred← citeshttps://doi.org/10.1007/978-3-540-39819-6_2openalex-snapshot
2. The Composition of Authenticated Byzantine Agreement
inferred← citeshttps://doi.org/10.1007/978-3-540-46464-8_6openalex-snapshot
The Power of Local Computations in Graphs with Initial Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-540-76627-8_19openalex-snapshot
Byzantine Self-stabilizing Pulse in a Bounded-Delay Model
inferred← citeshttps://doi.org/10.1007/978-3-540-76900-2_24openalex-snapshot
Efficient Byzantine Agreement with Faulty Minority
inferred← citeshttps://doi.org/10.1007/978-3-540-78524-8_17openalex-snapshot
Lower Bounds on Implementing Robust and Resilient Mediators
inferred← citeshttps://doi.org/10.1007/978-3-540-85762-4_24openalex-snapshot
Fair Exchange Is Incomparable to Consensus
inferred← citeshttps://doi.org/10.1007/978-3-540-87779-0_39openalex-snapshot
Easy Consensus Algorithms for the Crash-Recovery Model
inferred← citeshttps://doi.org/10.1007/978-3-642-04355-0_45openalex-snapshot
Optimum Simultaneous Consensus for General Omissions Is Equivalent to an NP Oracle
inferred← citeshttps://doi.org/10.1007/978-3-642-13190-5_24openalex-snapshot
Adaptively Secure Broadcast
inferred← citeshttps://doi.org/10.1007/978-3-642-15763-9_3openalex-snapshot
Fast Asynchronous Consensus with Optimal Resilience
inferred← citeshttps://doi.org/10.1007/978-3-642-29485-3_5openalex-snapshot
The Compass That Steered Robotics
inferred← citeshttps://doi.org/10.1007/978-3-642-31104-8_15openalex-snapshot
Homonyms with Forgeable Identifiers
inferred← citeshttps://doi.org/10.1007/978-3-642-61012-7_9openalex-snapshot
Zeit und Raum in Rechnernetzen
inferred← citeshttps://doi.org/10.1007/978-3-662-01110-2_5openalex-snapshot
Konsistenz und Fehlertoleranz in Verteilten Systemen — Das Problem der Byzantinischen Generäle
inferred← citeshttps://doi.org/10.1007/bf01187076openalex-snapshot
Modular construction of an efficient 1-bit Byzantine agreement protocol
inferred← citeshttps://doi.org/10.1007/bf01667081openalex-snapshot
Connectivity requirements for Byzantine agreement under restricted types of failures
inferred← citeshttps://doi.org/10.1007/bf02259749openalex-snapshot
Clock synchronization and the power of broadcasting
inferred← citeshttps://doi.org/10.1007/bf02280838openalex-snapshot
Efficient agreement using fault diagnosis
inferred← citeshttps://doi.org/10.1007/bfb0042324openalex-snapshot
A simple model for agreement in distributed systems
inferred← citeshttps://doi.org/10.1007/bfb0042327openalex-snapshot
An overview of clock synchronization
inferred← citeshttps://doi.org/10.1007/bfb0042342openalex-snapshot
Bibliography for fault-tolerant distributed computing
inferred← citeshttps://doi.org/10.1007/s00145-004-0150-yopenalex-snapshot
Minimal Complete Primitives for Secure Multi-Party Computation
inferred← citeshttps://doi.org/10.1007/s00145-005-0308-xopenalex-snapshot
Byzantine Agreement Given Partial Broadcast
inferred← citeshttps://doi.org/10.1007/s00145-005-0319-zopenalex-snapshot
Secure Multi-Party Computation without Agreement
inferred← citeshttps://doi.org/10.1007/s00145-023-09456-4openalex-snapshot
On the Power of an Honest Majority in Three-Party Computation Without Broadcast
inferred← citeshttps://doi.org/10.1007/s00145-023-09460-8openalex-snapshot
Must the Communication Graph of MPC Protocols be an Expander?
inferred← citeshttps://doi.org/10.1007/s00145-023-09484-0openalex-snapshot
Breaking the $$O(\sqrt{n})$$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party
inferred← citeshttps://doi.org/10.1007/s00224-003-1062-1openalex-snapshot
Characterizations of Classes of Graphs Recognizable by Local Computations
inferred← citeshttps://doi.org/10.1007/s00224-007-9006-9openalex-snapshot
Efficient Algorithms for Anonymous 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-004-0119-yopenalex-snapshot
Efficient reliable communication over partially authenticated networks
inferred← citeshttps://doi.org/10.1007/s00446-006-0010-0openalex-snapshot
On private computation in incomplete networks
inferred← citeshttps://doi.org/10.1007/s00446-013-0190-3openalex-snapshot
Byzantine agreement with homonyms
inferred← citeshttps://doi.org/10.1007/s00446-014-0240-5openalex-snapshot
Multidimensional agreement in Byzantine systems
inferred← citeshttps://doi.org/10.1007/s00446-024-00473-5openalex-snapshot
Communication lower bounds for cryptographic broadcast protocols
inferred← citeshttps://doi.org/10.1007/s00446-026-00507-0openalex-snapshot
Satrapy: From abstract to practical consensus for heterogeneous quorum systems
inferred← citeshttps://doi.org/10.1007/s004460050016openalex-snapshot
Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
inferred← citeshttps://doi.org/10.1007/s10773-019-04269-3openalex-snapshot
Quantum Multi-valued Byzantine Agreement Based on d-dimensional Entangled States
inferred← citeshttps://doi.org/10.1007/s11432-026-4996-4openalex-snapshot
Scalable and highly fault-tolerant circular quantum Byzantine agreement
inferred← citeshttps://doi.org/10.1016/0004-3702(94)00024-uopenalex-snapshot
On information invariants in robotics
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90223-vopenalex-snapshot
Space-efficient asynchronous consensus without shared memory initialization
inferred← citeshttps://doi.org/10.1016/0196-6774(90)90020-fopenalex-snapshot
A combinatorial characterization of the distributed 1-solvable tasks
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/b978-0-408-02938-4.50016-4openalex-snapshot
Key references in distributed computer systems 1959–1989
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50023-8openalex-snapshot
Distributed Computing: Models and Methods
inferred← citeshttps://doi.org/10.1016/b978-1-55860-348-6.50026-2openalex-snapshot
10.1016/b978-1-55860-348-6.50026-2
inferred← citeshttps://doi.org/10.1016/j.ast.2026.113060openalex-snapshot
Saturation-predictable prescribed performance hierarchical control for fly-around formation via secure distributed and edge-based event-triggered mechanisms
inferred← citeshttps://doi.org/10.1016/j.automatica.2019.108776openalex-snapshot
An anticipatory protocol to reach fast consensus in multi-agent systems
inferred← citeshttps://doi.org/10.1016/j.automatica.2021.109775openalex-snapshot
Secure consensus with distributed detection via two-hop communication
inferred← citeshttps://doi.org/10.1016/j.comnet.2022.109419openalex-snapshot
LWSBFT: Leaderless weakly synchronous BFT protocol
inferred← citeshttps://doi.org/10.1016/j.comnet.2022.109541openalex-snapshot
TSBFT: A scalable and efficient leaderless byzantine consensus for consortium blockchain
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.09.042openalex-snapshot
Multiparty Contract Signing Over a Reliable Network
inferred← citeshttps://doi.org/10.1016/j.eswa.2024.125102openalex-snapshot
MBFT: A Modular Byzantine Fault Tolerance Protocol for high adaptability
inferred← citeshttps://doi.org/10.1016/j.ic.2009.07.002openalex-snapshot
On the round complexity of Byzantine agreement without initial set-up
inferred← citeshttps://doi.org/10.1016/j.ic.2014.10.001openalex-snapshot
On the impact of link faults on Byzantine agreement
inferred← citeshttps://doi.org/10.1016/j.ic.2018.08.004openalex-snapshot
Improved time bounds for linearizable implementations of abstract data types
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105035openalex-snapshot
Synchronous t-resilient consensus in arbitrary graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2026.105497openalex-snapshot
Efficient quantum detectable weak Byzantine agreement with optimal fault-tolerant bound
inferred← citeshttps://doi.org/10.1016/j.robot.2025.105044openalex-snapshot
Saturation-tolerant prescribed performance neural formation control for air-floating robots under false data injection attacks
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.04.036openalex-snapshot
Agreement in synchronous networks with ubiquitous faults
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.06.001openalex-snapshot
Toward an algebraic theory of systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.08.001openalex-snapshot
Approximate Agreement under Mobile Byzantine Faults
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113733openalex-snapshot
Wait-free approximate agreement on graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00592-3openalex-snapshot
Computing on anonymous networks with sense of direction
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00241-2openalex-snapshot
Reliable communication over partially authenticated networks
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00194-xopenalex-snapshot
Graph Relabelling Systems A Tool for Encoding, Proving, Studying and Visualizing Distributed Algorithms
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80194-4openalex-snapshot
Graph Relabelling Systems
inferred← citeshttps://doi.org/10.1016/s1574-0005(05)80070-0openalex-snapshot
Chapter 38 Game-theoretic aspects of computing
inferred← citeshttps://doi.org/10.1023/a:1007914216733openalex-snapshot
Possible and Impossible Self-Stabilizing Digital Clock Synchronization in General Graphs
inferred← citeshttps://doi.org/10.1023/a:1007949113722openalex-snapshot
CesiumSpray: a Precise and Accurate Global Time Service for Large-scale Systems
inferred← citeshttps://doi.org/10.1080/00207169308804189openalex-snapshot
An algorithm for identification of maliciously faulty units
inferred← citeshttps://doi.org/10.1088/0253-6102/52/6/07openalex-snapshot
A New Solution to Detectable Byzantine Agreement Problem
inferred← citeshttps://doi.org/10.1103/physreva.92.042302openalex-snapshot
Quantum Byzantine agreement via Hardy correlations and entanglement swapping
inferred← citeshttps://doi.org/10.1103/physrevlett.87.217901openalex-snapshot
Quantum Solution to the Byzantine Agreement Problem
inferred← citeshttps://doi.org/10.1109/12.9732openalex-snapshot
A compiler that increases the fault tolerance of asynchronous protocols
inferred← citeshttps://doi.org/10.1109/2.153253openalex-snapshot
The many faces of consensus in distributed systems
inferred← citeshttps://doi.org/10.1109/access.2022.3175998openalex-snapshot
Reaching Efficient Byzantine Agreements in Bipartite Networks
inferred← citeshttps://doi.org/10.1109/ares.2016.26openalex-snapshot
Byzantine Set-Union Consensus Using Efficient Set Reconciliation
inferred← citeshttps://doi.org/10.1109/cdc57313.2025.11312351openalex-snapshot
A Tutorial on Distributed Multi-Armed Bandits
inferred← citeshttps://doi.org/10.1109/csda.1998.798365openalex-snapshot
From security to safety and back
inferred← citeshttps://doi.org/10.1109/dsn.2001.941391openalex-snapshot
How to model link failures: a perception-based fault model
inferred← citeshttps://doi.org/10.1109/dsn.2019.00063openalex-snapshot
SBFT: A Scalable and Decentralized Trust Infrastructure
inferred← citeshttps://doi.org/10.1109/fas-w.2019.00066openalex-snapshot
Blockchain Technology: Practical P2P Computing (Tutorial)
inferred← citeshttps://doi.org/10.1109/ftcs.1998.689460openalex-snapshot
The SunSCALR framework for Internet servers
inferred← citeshttps://doi.org/10.1109/fuzz.2003.1206609openalex-snapshot
Notice of Violation of IEEE Publication Principles: Which models should be applied to measure computer security and information assurance?
inferred← citeshttps://doi.org/10.1109/icca65672.2025.11129708openalex-snapshot
A Graph-Relaxed Method for Byzantine-Resilient Distributed Multidimensional Consensus
inferred← citeshttps://doi.org/10.1109/icdcs.2002.1022311openalex-snapshot
Formally verified Byzantine agreement in presence of link faults
inferred← citeshttps://doi.org/10.1109/icdcs.2016.68openalex-snapshot
Approximate Agreement under Mobile Byzantine Faults
inferred← citeshttps://doi.org/10.1109/icdcs47774.2020.00056openalex-snapshot
Synchronous Byzantine Lattice Agreement in O(log(f) Rounds
inferred← citeshttps://doi.org/10.1109/icnp.1995.524853openalex-snapshot
A reliable ordered delivery protocol for interconnected local area networks
inferred← citeshttps://doi.org/10.1109/ipdps.2014.77openalex-snapshot
Improved Time Bounds for Linearizable Implementations of Abstract Data Types
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834558openalex-snapshot
Byzantine Consensus Over Broadcast Channels
inferred← citeshttps://doi.org/10.1109/itsc.2014.6957835openalex-snapshot
Cooperation with disagreement correction in the presence of communication failures
inferred← citeshttps://doi.org/10.1109/itwtpi.2005.1543955openalex-snapshot
Broadcast and secure computation under reduced setup assumptions
inferred← citeshttps://doi.org/10.1109/lics.2015.69openalex-snapshot
Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth
inferred← citeshttps://doi.org/10.1109/nca.2017.8171382openalex-snapshot
Blockchain abbreviation: Implemented by message passing and shared memory (Extended abstract)
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267776openalex-snapshot
Fault-tolerant wait-free shared objects
inferred← citeshttps://doi.org/10.1109/tdsc.2024.3357521openalex-snapshot
Trusted Hardware-Assisted Leaderless Byzantine Fault Tolerance Consensus
inferred← citeshttps://doi.org/10.1109/tit.2025.3649987openalex-snapshot
Consensus Capacity of Noisy Broadcast Channels
inferred← citeshttps://doi.org/10.1109/tpds.2021.3056718openalex-snapshot
PISTIS: An Event-Triggered Real-Time Byzantine-Resilient Protocol Suite
inferred← citeshttps://doi.org/10.1126/sciadv.adp2877openalex-snapshot
Experimental quantum Byzantine agreement on a three-user quantum network with integrated photonics
inferred← citeshttps://doi.org/10.1137/s009753970443999xopenalex-snapshot
Impossibility Results and Lower Bounds for Consensus under Link Failures
inferred← citeshttps://doi.org/10.1145/10590.10596openalex-snapshot
A communication-efficient canonical form for fault-tolerant distributed protocols
inferred← citeshttps://doi.org/10.1145/10590.10602openalex-snapshot
Gap theorems for distributed computing
inferred← citeshttps://doi.org/10.1145/1103576.1103579openalex-snapshot
On fairness in simulatability-based cryptographic systems
inferred← citeshttps://doi.org/10.1145/1217856.1217857openalex-snapshot
On the composition of authenticated Byzantine Agreement
inferred← citeshttps://doi.org/10.1145/135419.135431openalex-snapshot
Computing with faulty shared memory
inferred← citeshttps://doi.org/10.1145/138027.138036openalex-snapshot
Perfectly secure message transmission
inferred← citeshttps://doi.org/10.1145/152610.152612openalex-snapshot
The consensus problem in fault-tolerant computing
inferred← citeshttps://doi.org/10.1145/1989493.1989516openalex-snapshot
Stabilizing consensus with the power of two choices
inferred← citeshttps://doi.org/10.1145/1993806.1993810openalex-snapshot
Byzantine agreement with homonyms
inferred← citeshttps://doi.org/10.1145/227683.227688openalex-snapshot
Computing with faulty shared objects
inferred← citeshttps://doi.org/10.1145/2488608.2488657openalex-snapshot
Multidimensional approximate agreement in Byzantine asynchronous systems
inferred← citeshttps://doi.org/10.1145/278298.278305openalex-snapshot
Fault-tolerant wait-free shared objects
inferred← citeshttps://doi.org/10.1145/2993749.2993763openalex-snapshot
Distributed Computing Column 63
inferred← citeshttps://doi.org/10.1145/311531.311532openalex-snapshot
Fundamentals of fault-tolerant distributed computing in asynchronous environments
inferred← citeshttps://doi.org/10.1145/3210377.3210399openalex-snapshot
Breaking the $ilde$Omega($sqrt{n})$ Barrier
inferred← citeshttps://doi.org/10.1145/3212734.3212762openalex-snapshot
Tight Bounds for Asymptotic and Approximate Consensus
inferred← citeshttps://doi.org/10.1145/323596.323617openalex-snapshot
A formal model of knowledge, action, and communication in distributed systems
inferred← citeshttps://doi.org/10.1145/3293611.3331619openalex-snapshot
Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model
inferred← citeshttps://doi.org/10.1145/3419614.3423250openalex-snapshot
Asynchronous Byzantine Agreement in Incomplete Networks
inferred← citeshttps://doi.org/10.1145/3465084.3467897openalex-snapshot
Breaking the O(√ n)-Bit Barrier
inferred← citeshttps://doi.org/10.1145/3485242openalex-snapshot
Tight Bounds for Asymptotic and Approximate Consensus
inferred← citeshttps://doi.org/10.1145/3519935.3520015openalex-snapshot
Byzantine agreement in polynomial time with near-optimal resilience
inferred← citeshttps://doi.org/10.1145/3576915.3623080openalex-snapshot
TrustBoost: Boosting Trust among Interoperable Blockchains
inferred← citeshttps://doi.org/10.1145/3618260.3649736openalex-snapshot
Optimal Load-Balanced Scalable Distributed Agreement
inferred← citeshttps://doi.org/10.1145/3639454openalex-snapshot
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection
inferred← citeshttps://doi.org/10.1145/3721462.3770782openalex-snapshot
Message Size Matters: AlterBFT’s Approach to Practical Synchronous BFT in Public Clouds
inferred← citeshttps://doi.org/10.1145/3732772.3733553openalex-snapshot
Improved Byzantine Agreement under an Adaptive Adversary
inferred← citeshttps://doi.org/10.1145/3796701.3815918openalex-snapshot
Reaching Univalency with Subquadratic Communication
inferred← citeshttps://doi.org/10.1145/3796701.3815934openalex-snapshot
Brief Announcement: What is Agreement About if not Common Knowledge?
inferred← citeshttps://doi.org/10.1145/509907.509982openalex-snapshot
On the composition of authenticated byzantine agreement
inferred← citeshttps://doi.org/10.1145/571825.571841openalex-snapshot
Detectable byzantine agreement secure against faulty majorities
inferred← citeshttps://doi.org/10.1145/5925.5931openalex-snapshot
Reaching approximate agreement in the presence of faults
inferred← citeshttps://doi.org/10.1145/62546.62590openalex-snapshot
A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor
inferred← citeshttps://doi.org/10.1145/72981.72982openalex-snapshot
A hundred impossibility proofs for distributed computing
inferred← citeshttps://doi.org/10.1145/72981.73002openalex-snapshot
Modular construction of nearly optimal Byzantine agreement protocols
inferred← citeshttps://doi.org/10.1145/73007.73052openalex-snapshot
On the improbability of reaching Byzantine agreements
inferred← citeshttps://doi.org/10.1145/872035.872070openalex-snapshot
Efficient reliable communication over partially authenticated networks
inferred← citeshttps://doi.org/10.1186/s13635-017-0066-3openalex-snapshot
Byzantine set-union consensus using efficient set reconciliation
inferred← citeshttps://doi.org/10.1201/9781420059823openalex-snapshot
Handbook of Financial Cryptography and Security
inferred← citeshttps://doi.org/10.14257/ijca.2018.11.4.01openalex-snapshot
Large-scale Deadline-Constrained Causal Order Broadcast Algorithm for Enhancing Message Delivery Success Rate Performance
inferred← citeshttps://doi.org/10.20868/upm.thesis.56275openalex-snapshot
Generalización de procesos de consenso en redes complejas
showing the first 200 of 234 · page through all 234
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.