On the public citation graph
Simulating authenticated broadcasts to derive simple fault-tolerant algorithms
0 signed · 223 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.1016/0196-6774(82)90004-9openalex-snapshot
The Byzantine generals strike again
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.1137/0212045openalex-snapshot
Authenticated Algorithms for Byzantine Agreement
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/322186.322188openalex-snapshot
Reaching Agreement in the Presence of Faults
inferredcites →https://doi.org/10.1145/357980.358017openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/5236.5243openalex-snapshot
Applications of Byzantine agreement in database systems
inferredcites →https://doi.org/10.1145/800221.806712openalex-snapshot
Method for distributed transaction commit and recovery using Byzantine Agreement within clusters of processors
inferredcites →https://doi.org/10.1145/800222.806738openalex-snapshot
A new fault-tolerant algorithm for clock synchronization
inferredcites →https://doi.org/10.1145/800222.806739openalex-snapshot
Fault-tolerant clock synchronization
inferredcites →https://doi.org/10.1145/800222.806741openalex-snapshot
Elections in the presence of faults
inferredcites →https://doi.org/10.1145/800222.806744openalex-snapshot
Randomized Byzantine Agreements
inferredcites →https://doi.org/10.21236/ada113241openalex-snapshot
A Simple and Efficient Byzantine Generals Algorithm.
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.1007/11516798_17openalex-snapshot
Optimal Resilience Asynchronous Approximate Agreement
inferred← citeshttps://doi.org/10.1007/11864219_2openalex-snapshot
Renaming in Message Passing Systems with Byzantine Failures
inferred← citeshttps://doi.org/10.1007/3-540-52921-7_85openalex-snapshot
Distributed function evaluation in the presence of transmission faults
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_3openalex-snapshot
Fault-tolerant naming and mutual exclusion
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_11openalex-snapshot
A continuum of failure models for distributed computing
inferred← citeshttps://doi.org/10.1007/3-540-56188-9_12openalex-snapshot
Simulating crash failures with many faulty processors (extended abstract)
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_91openalex-snapshot
Consensus with Partial Synchrony
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-4939-2864-4_91openalex-snapshot
Consensus with Partial Synchrony
inferred← citeshttps://doi.org/10.1007/978-3-030-03424-5_22openalex-snapshot
ByMC: Byzantine Model Checker
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-25543-5_15openalex-snapshot
Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics
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-59152-6_11openalex-snapshot
Eliminating Message Counters in Threshold Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-59152-6_8openalex-snapshot
Complexity of Verification and Synthesis of Threshold Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-67087-0_14openalex-snapshot
Verifying Safety of Parameterized Heard-Of Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-91081-5_2openalex-snapshot
Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn
inferred← citeshttps://doi.org/10.1007/978-3-030-91081-5_28openalex-snapshot
Synchronization Modulo k in Dynamic Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-19135-0_9openalex-snapshot
Coefficient Synthesis for Threshold Automata
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-63501-4_7openalex-snapshot
A Logic for Repair and State Recovery in Byzantine Fault-Tolerant Multi-agent Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-71162-6_33openalex-snapshot
Parameterized Verification of Round-Based Distributed Algorithms via Extended Threshold Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-07317-0_4openalex-snapshot
Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-21690-4_6openalex-snapshot
SMT and POR Beat Counter Abstraction: Parameterized Model Checking of Threshold-Based Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-40229-1_6openalex-snapshot
Counting Constraints in Flat Array Fragments
inferred← citeshttps://doi.org/10.1007/978-3-319-41579-6_2openalex-snapshot
What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-52234-0_19openalex-snapshot
Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-61204-1_28openalex-snapshot
cMix: Mixing with Minimal Real-Time Asymmetric Cryptographic Operations
inferred← citeshttps://doi.org/10.1007/978-3-540-75142-7_15openalex-snapshot
From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors
inferred← citeshttps://doi.org/10.1007/978-3-540-77096-1_17openalex-snapshot
Making Distributed Applications Robust
inferred← citeshttps://doi.org/10.1007/978-3-540-77096-1_6openalex-snapshot
Byzantine Consensus with Few Synchronous Links
inferred← citeshttps://doi.org/10.1007/978-3-540-77096-1_7openalex-snapshot
Clock Synchronization in the Byzantine-Recovery Failure Model
inferred← citeshttps://doi.org/10.1007/978-3-540-87779-0_2openalex-snapshot
Matrix Signatures: From MACs to Digital Signatures in Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-87779-0_3openalex-snapshot
How to Solve Consensus in the Smallest Window of Synchrony
inferred← citeshttps://doi.org/10.1007/978-3-642-10877-8_24openalex-snapshot
Unifying Byzantine Consensus Algorithms with Weak Interactive Consistency
inferred← citeshttps://doi.org/10.1007/978-3-642-11322-2_10openalex-snapshot
On Composability of Reliable Unicast and Broadcast
inferred← citeshttps://doi.org/10.1007/978-3-642-11322-2_11openalex-snapshot
A Leader-Free Byzantine Consensus Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-11322-2_12openalex-snapshot
Authenticated Byzantine Generals in Dual Failure Model
inferred← citeshttps://doi.org/10.1007/978-3-642-17653-1_13openalex-snapshot
Signature-Free Broadcast-Based Intrusion Tolerance: Never Decide a Byzantine Value
inferred← citeshttps://doi.org/10.1007/978-3-642-24100-0_38openalex-snapshot
Byzantine Agreement Using Partial Authentication
inferred← citeshttps://doi.org/10.1007/978-3-642-25873-2_7openalex-snapshot
Regret Freedom Isn’t Free
inferred← citeshttps://doi.org/10.1007/978-3-642-25959-3_6openalex-snapshot
Byzantine Agreement with Homonyms in Synchronous Systems
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-33536-5_29openalex-snapshot
All-to-All Gradecast Using Coding with Byzantine Failures
inferred← citeshttps://doi.org/10.1007/978-3-642-35668-1_12openalex-snapshot
Uniform Consensus with Homonyms and Omission Failures
inferred← citeshttps://doi.org/10.1007/978-3-642-39176-7_14openalex-snapshot
Towards Modeling and Model Checking Fault-Tolerant Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-76462-2_22openalex-snapshot
A Consistency Condition Supporting Design and Verification of Byzantine Adaptive Agreement Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-76930-6_10openalex-snapshot
Adaptive Byzantine Agreement in O(t) Phases
inferred← citeshttps://doi.org/10.1007/978-3-662-44584-6_10openalex-snapshot
On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability
inferred← citeshttps://doi.org/10.1007/978-3-662-45174-8_16openalex-snapshot
Who Are You? Secure Identities in Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-662-53426-7_16openalex-snapshot
Are Byzantine Failures Really Different from Crash Failures?
inferred← citeshttps://doi.org/10.1007/bf01187074openalex-snapshot
Message-optimal protocols for Byzantine Agreement
inferred← citeshttps://doi.org/10.1007/bf02277668openalex-snapshot
A self-adjusting algorithm for byzantine agreement
inferred← citeshttps://doi.org/10.1007/bf02280838openalex-snapshot
Efficient agreement using fault diagnosis
inferred← citeshttps://doi.org/10.1007/bfb0022441openalex-snapshot
Optimally simulating crash failures in a byzantine environment
inferred← citeshttps://doi.org/10.1007/bfb0042324openalex-snapshot
A simple model for agreement in distributed systems
inferred← citeshttps://doi.org/10.1007/bfb0042342openalex-snapshot
Bibliography for fault-tolerant distributed computing
inferred← citeshttps://doi.org/10.1007/s00224-007-9006-9openalex-snapshot
Efficient Algorithms for Anonymous Byzantine Agreement
inferred← citeshttps://doi.org/10.1007/s00224-013-9481-0openalex-snapshot
Computational Aspects of Uncertainty Profiles and Angel-Daemon Games
inferred← citeshttps://doi.org/10.1007/s00446-007-0026-0openalex-snapshot
Booting clock synchronization in partially synchronous systems with hybrid process and link failures
inferred← citeshttps://doi.org/10.1007/s00446-007-0045-xopenalex-snapshot
Renaming in synchronous message passing systems with Byzantine failures
inferred← citeshttps://doi.org/10.1007/s00446-011-0147-3openalex-snapshot
Consensus in the presence of mortal Byzantine faulty processes
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-016-0280-0openalex-snapshot
Who are you? Secure identities in single hop ad hoc networks
inferred← citeshttps://doi.org/10.1007/s00446-024-00469-1openalex-snapshot
Asymmetric distributed trust
inferred← citeshttps://doi.org/10.1007/s00607-022-01135-9openalex-snapshot
Uniform atomic broadcast and consensus in fully anonymous synchronous systems with crash failures
inferred← citeshttps://doi.org/10.1007/s10009-021-00637-9openalex-snapshot
Verifying safety of synchronous fault-tolerant algorithms by bounded model checking
inferred← citeshttps://doi.org/10.1007/s10703-017-0279-6openalex-snapshot
Cardinality constraints for arrays (decidability results and applications)
inferred← citeshttps://doi.org/10.1007/s10703-017-0297-4openalex-snapshot
Para $$^2$$ 2 : parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
inferred← citeshttps://doi.org/10.1007/s10703-021-00377-1openalex-snapshot
Temporal prophecy for proving temporal properties of infinite-state systems
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/s10817-020-09578-5openalex-snapshot
Higher-Order Quantifier Elimination, Counter Simulations and Fault-Tolerant Systems
inferred← citeshttps://doi.org/10.1007/s11219-020-09539-6openalex-snapshot
Reductions and abstractions for formal verification of distributed round-based algorithms
inferred← citeshttps://doi.org/10.1007/s11227-019-03001-6openalex-snapshot
Hybrid binary consensus in anonymous asynchronous systems using coins and failure detectors
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/0196-6774(90)90019-bopenalex-snapshot
Automatically increasing the fault-tolerance of distributed algorithms
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90072-nopenalex-snapshot
Two distributed problems involving involving byzantine processes
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/c2011-0-07032-1openalex-snapshot
Distributed Computing Through Combinatorial Topology
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.12.011openalex-snapshot
Deontic Logic, Contrary to Duty Reasoning and Fault Tolerance
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.2016.03.006openalex-snapshot
On the completeness of bounded model checking for threshold-based distributed algorithms: Reachability
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104701openalex-snapshot
Clairvoyant state machine replication
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.06.003openalex-snapshot
Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures
inferred← citeshttps://doi.org/10.1016/j.jpdc.2022.07.004openalex-snapshot
How to achieve adaptive security for asynchronous BFT?
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.1016/j.tcs.2012.11.012openalex-snapshot
Byzantine agreement with homonyms in synchronous systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.03.018openalex-snapshot
Randomized k-set agreement in crash-prone and Byzantine asynchronous systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.07.023openalex-snapshot
The firing squad problem revisited
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.11.033openalex-snapshot
Synchronization modulo P in dynamic networks
inferred← citeshttps://doi.org/10.1080/00207169308804189openalex-snapshot
An algorithm for identification of maliciously faulty units
inferred← citeshttps://doi.org/10.1080/15427951.2009.10129181openalex-snapshot
The Price of Malice: A Game-Theoretic Framework for Malicious Behavior in Distributed Systems
inferred← citeshttps://doi.org/10.1080/17445760.2023.2199992openalex-snapshot
Minimal synchrony for implementing Timely Provable Reliable Send primitive with Byzantine failures
inferred← citeshttps://doi.org/10.1093/comjnl/bxt063openalex-snapshot
Analysing Web-Orchestrations Under Stress Using Uncertainty Profiles
inferred← citeshttps://doi.org/10.1109/12.9743openalex-snapshot
Reliable broadcast in hypercube multicomputers
inferred← citeshttps://doi.org/10.1109/32.256850openalex-snapshot
Closure and convergence: a foundation of fault-tolerant computing
inferred← citeshttps://doi.org/10.1109/access.2022.3175998openalex-snapshot
Reaching Efficient Byzantine Agreements in Bipartite Networks
inferred← citeshttps://doi.org/10.1109/access.2022.3202627openalex-snapshot
Dynamic Byzantine Broadcast in Asynchronous Message-Passing Systems
inferred← citeshttps://doi.org/10.1109/dsn.2006.22openalex-snapshot
Consensus with Byzantine Failures and Little System Synchrony
inferred← citeshttps://doi.org/10.1109/dsn48063.2020.00058openalex-snapshot
EPIC: Efficient Asynchronous BFT with Adaptive Security
inferred← citeshttps://doi.org/10.1109/fmcad.2013.6679411openalex-snapshot
Parameterized model checking of fault-tolerant distributed algorithms by abstraction
inferred← citeshttps://doi.org/10.1109/ftcs.1992.243596openalex-snapshot
Closure and convergence: a formulation of fault-tolerant computing
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/ftpds.1994.494498openalex-snapshot
Synchronizing clocks in a system resilient to a wide class of failures
inferred← citeshttps://doi.org/10.1109/giis.2015.7347177openalex-snapshot
Secure distributed demand projection in micro-grids
inferred← citeshttps://doi.org/10.1109/icpads53394.2021.00098openalex-snapshot
Simulating Authenticated Broadcast in Networks of Bounded Degree
inferred← citeshttps://doi.org/10.1109/imf.2018.00012openalex-snapshot
Principles of Secure Logging for Safekeeping Digital Evidence
inferred← citeshttps://doi.org/10.1109/ipdps47924.2020.00075openalex-snapshot
Byzantine Generalized Lattice Agreement
inferred← citeshttps://doi.org/10.1109/ipdps49936.2021.00104openalex-snapshot
Byzantine Agreement with Unknown Participants and Failures
inferred← citeshttps://doi.org/10.1109/nca.2018.8548057openalex-snapshot
DBFT: Efficient Leaderless Byzantine Consensus and its Application to Blockchains
inferred← citeshttps://doi.org/10.1109/prdc.2001.992685openalex-snapshot
Automatic verification of fault tolerance using model checking
inferred← citeshttps://doi.org/10.1109/real.1990.128742openalex-snapshot
New latency bounds for atomic broadcast
inferred← citeshttps://doi.org/10.1109/reldis.1988.25784openalex-snapshot
Interactive consistency with multiple failure modes
inferred← citeshttps://doi.org/10.1109/reldis.2003.1238089openalex-snapshot
Randomized asynchronous consensus with imperfect communications
inferred← citeshttps://doi.org/10.1109/rtas52030.2021.00037openalex-snapshot
Do Not Overpay for Fault Tolerance!
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267776openalex-snapshot
Fault-tolerant wait-free shared objects
inferred← citeshttps://doi.org/10.1109/sp.2018.00011openalex-snapshot
Anonymity Trilemma: Strong Anonymity, Low Bandwidth Overhead, Low Latency - Choose Two
inferred← citeshttps://doi.org/10.1109/sp61157.2025.00021openalex-snapshot
Sailfish: Towards Improving the Latency of DAG-Based BFT
inferred← citeshttps://doi.org/10.1109/srds.2018.00036openalex-snapshot
Byzantine Agreement with Interval Validity
inferred← citeshttps://doi.org/10.1109/srds60354.2023.00020openalex-snapshot
GradedDAG: An Asynchronous DAG-based BFT Consensus with Lower Latency
inferred← citeshttps://doi.org/10.1109/tdsc.2025.3568460openalex-snapshot
MiB: Asynchronous BFT With More Replicas
inferred← citeshttps://doi.org/10.1109/tifs.2024.3382602openalex-snapshot
Sweeper: Breaking the Validity-Latency Tradeoff in Asynchronous Common Subset
inferred← citeshttps://doi.org/10.1109/tifs.2024.3409082openalex-snapshot
Wahoo: A DAG-Based BFT Consensus With Low Latency and Low Communication Overhead
inferred← citeshttps://doi.org/10.1109/tmc.2012.225openalex-snapshot
Byzantine Fault-Tolerant Consensus in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/tnse.2026.3655638openalex-snapshot
Vega: An Asynchronous BFT With Lower Communication Overhead and Lower Latency
inferred← citeshttps://doi.org/10.1109/tpds.2015.2427797openalex-snapshot
Intrusion-Tolerant Broadcast and Agreement Abstractions in the Presence of Byzantine Processes
inferred← citeshttps://doi.org/10.1137/s009753970443999xopenalex-snapshot
Impossibility Results and Lower Bounds for Consensus under Link Failures
inferred← citeshttps://doi.org/10.1145/164051.164074openalex-snapshot
Unifying self-stabilization and fault-tolerance
inferred← citeshttps://doi.org/10.1145/177492.177745openalex-snapshot
How to securely replicate services
inferred← citeshttps://doi.org/10.1145/1993806.1993810openalex-snapshot
Byzantine agreement with homonyms
inferred← citeshttps://doi.org/10.1145/2488608.2488657openalex-snapshot
Multidimensional approximate agreement in Byzantine asynchronous systems
inferred← citeshttps://doi.org/10.1145/2591796.2591853openalex-snapshot
Distributed computability in Byzantine asynchronous systems
inferred← citeshttps://doi.org/10.1145/2611462.2611468openalex-snapshot
Signature-free asynchronous byzantine consensus with t < n/3 and o(n 2 ) messages
inferred← citeshttps://doi.org/10.1145/278298.278305openalex-snapshot
Fault-tolerant wait-free shared objects
inferred← citeshttps://doi.org/10.1145/2785953openalex-snapshot
Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time
inferred← citeshttps://doi.org/10.1145/2833312.2833313openalex-snapshot
Modular randomized byzantine k-set agreement in asynchronous message-passing systems
inferred← citeshttps://doi.org/10.1145/29868.31332openalex-snapshot
On the reliability of consensus-based fault-tolerant distributed computing systems
inferred← citeshttps://doi.org/10.1145/3009837.3009860openalex-snapshot
A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
inferred← citeshttps://doi.org/10.1145/3093333.3009860openalex-snapshot
A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
inferred← citeshttps://doi.org/10.1145/323596.323604openalex-snapshot
Fast distributed agreement (preliminary version)
inferred← citeshttps://doi.org/10.1145/3538227openalex-snapshot
Byzantine Fault Tolerance For Distributed Ledgers Revisited
inferred← citeshttps://doi.org/10.1145/3571259openalex-snapshot
Probabilistic Resource-Aware Session Types
inferred← citeshttps://doi.org/10.1145/3694906.3743343openalex-snapshot
Approximate Agreement Algorithms for Byzantine Collaborative Learning
inferred← citeshttps://doi.org/10.1145/3709023.3737691openalex-snapshot
Coordinate-Wise Median in Byzantine Federated Learning
inferred← citeshttps://doi.org/10.1145/3732772.3733550openalex-snapshot
You can lie but not deny: SWMR registers with signature properties in systems with Byzantine processes
inferred← citeshttps://doi.org/10.1145/42282.42283openalex-snapshot
Consensus in the presence of partial synchrony
inferred← citeshttps://doi.org/10.1145/62546.62588openalex-snapshot
Automatically increasing the fault-tolerance of distributed systems
inferred← citeshttps://doi.org/10.1145/72981.73002openalex-snapshot
Modular construction of nearly optimal Byzantine agreement protocols
inferred← citeshttps://doi.org/10.1145/96559.96565openalex-snapshot
Early stopping in Byzantine agreement
inferred← citeshttps://doi.org/10.1186/s42400-025-00501-2openalex-snapshot
Survey of Consensus Protocol’s Formal Verification
inferred← citeshttps://doi.org/10.1515/piko.2009.0021openalex-snapshot
A Framework for Probabilistic, Authentic Aggregation in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1515/popets-2017-0031openalex-snapshot
PathShuffle: Credit Mixing and Anonymous Payments for Ripple
inferred← citeshttps://doi.org/10.18698/2308-6033-2021-5-2081openalex-snapshot
Clock synchronization in distributed multicomputer systems. Part II
inferred← citeshttps://doi.org/10.20868/upm.thesis.76516openalex-snapshot
Agreement in adversarial environments with anonymous and Byzantine elements
inferred← citeshttps://doi.org/10.21236/ada248300openalex-snapshot
How to Securely Replicate Services (Preliminary Version)
inferred← citeshttps://doi.org/10.2139/ssrn.5139232openalex-snapshot
Network Abstractions for Characterizing Communication Requirements in Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.2200/s00294ed1v01y201009dct003openalex-snapshot
Fault-tolerant Agreement in Synchronous Message-passing Systems
inferred← citeshttps://doi.org/10.2200/s00658ed1v01y201508dct013openalex-snapshot
Decidability of Parameterized Verification
inferred← citeshttps://doi.org/10.26577/jmmcs-2017-4-455openalex-snapshot
Distributed algorithms and their verification with Byzantine model checker
inferred← citeshttps://doi.org/10.3384/diss.diva-173568openalex-snapshot
Parameterized Verification of Synchronized Concurrent Programs
inferred← citeshttps://doi.org/10.3929/ethz-a-005273546openalex-snapshot
Locality, Scheduling, and Selfishness: Algorithmic Foundations of Highly Decentralized Networks
inferred← citeshttps://doi.org/10.3929/ethz-b-000451222openalex-snapshot
Byzantine Agreement on Representative Input Values Over Public Channels
inferred← citeshttps://doi.org/10.4204/eptcs.262.5openalex-snapshot
Counter Simulations via Higher Order Quantifier Elimination: a preliminary report
inferred← citeshttps://doi.org/10.4204/eptcs.379.37openalex-snapshot
A Sufficient Condition for Gaining Belief in Byzantine Fault-Tolerant Distributed Systems
inferred← citeshttps://doi.org/10.4230/lipics.aft.2025.13openalex-snapshot
A New Look at Composition of Authenticated Byzantine Generals
inferred← citeshttps://doi.org/10.4230/lipics.disc.2017.35openalex-snapshot
Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems
inferred← citeshttps://doi.org/10.4230/lipics.disc.2019.29openalex-snapshot
Byzantine Approximate Agreement on Graphs
inferred← citeshttps://doi.org/10.4230/lipics.disc.2021.3openalex-snapshot
Frugal Byzantine Computing
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2020.37openalex-snapshot
Complexity of Verification and Synthesis of Threshold Automata
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2020.4openalex-snapshot
Byzantine Lattice Agreement in Asynchronous Systems
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.1210.3839openalex-snapshot
Starting a Dialog between Model Checking and Fault-tolerant Distributed Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1210.3846openalex-snapshot
Counter Attack on Byzantine Generals: Parameterized Model Checking of Fault-tolerant Distributed Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1302.6224openalex-snapshot
Distributed Computability in Byzantine Asynchronous Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1510.09119openalex-snapshot
From Byzantine Failures to Crash Failures in Message-Passing Systems: a BG Simulation-based approach
inferred← citeshttps://doi.org/10.48550/arxiv.1602.00458openalex-snapshot
Counting Constraints in Flat Array Fragments
inferred← citeshttps://doi.org/10.48550/arxiv.1707.01873openalex-snapshot
Blockchain Consensus Protocols in the Wild
inferred← citeshttps://doi.org/10.48550/arxiv.1803.02720openalex-snapshot
Byzantine Preferential Voting
showing the first 200 of 204 · page through all 204
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.