Pages that link to "Item:Q4031321"
From MaRDI portal
The following pages link to Message-optimal protocols for Byzantine Agreement (Q4031321):
Displayed 9 items.
- Robust gossiping with an application to consensus (Q856404) (← links)
- On the message complexity of binary Byzantine agreement under crash failures (Q1189856) (← links)
- Optimistically tuning synchronous Byzantine consensus: another win for null messages (Q2241306) (← 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)
- Brief Announcement: Improved Consensus in Quantum Networks (Q6202264) (← links)
- Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication (Q6202273) (← links)