Pages that link to "Item:Q3765232"
From MaRDI portal
The following pages link to Asynchronous consensus and broadcast protocols (Q3765232):
Displaying 42 items.
- On the performance of a retransmission-based synchronizer (Q392190) (← links)
- Consensus in the presence of mortal Byzantine faulty processes (Q424903) (← links)
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability (Q729813) (← links)
- Invited talk: Resilient distributed algorithms (Q831782) (← links)
- Asynchronous byzantine agreement protocols (Q1091131) (← links)
- Consensus under unreliable transmission (Q1285678) (← links)
- Necessary and sufficient conditions for broadcast consensus protocols. (Q1312603) (← links)
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms (Q1696580) (← links)
- Byzantine-resistant total ordering algorithms. (Q1854265) (← links)
- Diffusion without false rumors: On propagating updates in a Byzantine environment. (Q1874396) (← links)
- Low complexity Byzantine-resilient consensus (Q1953244) (← links)
- Byzantine-tolerant causal broadcast (Q1981768) (← links)
- Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures (Q2009633) (← links)
- Higher-order quantifier elimination, counter simulations and fault-tolerant systems (Q2031422) (← links)
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback (Q2096546) (← links)
- Order-fairness for Byzantine consensus (Q2102076) (← links)
- The consensus number of a cryptocurrency (Q2121054) (← links)
- Synthesizing optimal bias in randomized self-stabilization (Q2121058) (← links)
- Byzantine disk paxos: optimal resilience with Byzantine shared memory (Q2375303) (← links)
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time (Q2406433) (← links)
- A discrete-event simulation model for the Bitcoin blockchain network with strategic miners and mining pool managers (Q2669486) (← links)
- MPC with synchronous security and asynchronous responsiveness (Q2691582) (← links)
- Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms (Q2961576) (← links)
- What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms (Q3179167) (← links)
- Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n 2) Messages, and Constant Time (Q3460716) (← links)
- On the Versatility of Bracha’s Byzantine Reliable Broadcast Algorithm (Q5087090) (← links)
- (Q5091093) (← links)
- Torus orientation (Q5138369) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Randomized protocols for asynchronous consensus (Q5138489) (← links)
- Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms (Q5175774) (← links)
- Extracting Symbolic Transitions from TLA$$^{+}$$+ Specifications (Q5881447) (← links)
- Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker (Q5883751) (← links)
- AbU: a calculus for distributed event-driven programming with attribute-based interaction (Q6038690) (← links)
- Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast (Q6047193) (← links)
- Asynchronous Byzantine reliable broadcast with a message adversary (Q6050128) (← links)
- Total ordering algorithms for asynchronous Byzantine systems (Q6084560) (← links)
- On the power of an honest majority in three-party computation without broadcast (Q6109073) (← links)
- Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast (Q6155246) (← links)
- Consensus on demand (Q6155257) (← links)
- Divide \& Scale: formalization and roadmap to robust sharding (Q6188156) (← links)
- Distributed CONGEST Algorithms against Mobile Adversaries (Q6202259) (← links)
