Pages that link to "Item:Q4031321"
From MaRDI portal
The following pages link to Message-optimal protocols for Byzantine Agreement (Q4031321):
Displaying 15 items.
- Consensus algorithms with one-bit messages (Q757011) (← links)
- Robust gossiping with an application to consensus (Q856404) (← links)
- On the message complexity of binary Byzantine agreement under crash failures (Q1189856) (← links)
- Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits (Q2002052) (← links)
- Round-optimal Byzantine agreement (Q2169994) (← links)
- Optimistically tuning synchronous Byzantine consensus: another win for null messages (Q2241306) (← links)
- Optimal extension protocols for Byzantine broadcast and agreement (Q2657277) (← links)
- Message Lower Bounds via Efficient Network Synchronization (Q2835018) (← links)
- The Failure Discovery problem (Q4031322) (← links)
- Modular construction of an efficient 1-bit Byzantine agreement protocol (Q4031323) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Using counterfactuals in knowledge-based programming (Q5138508) (← links)
- Optimally efficient multi-valued byzantine agreement (Q5177277) (← links)
- Scalable and secure computation among strangers: message-competitive Byzantine protocols (Q6535030) (← links)
- Sublinear message bounds of authenticated implicit Byzantine agreement (Q6646446) (← links)