Pages that link to "Item:Q1187030"
From MaRDI portal
The following pages link to Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement (Q1187030):
Displaying 18 items.
- Visiting Byzantine Agreement underlying ad hoc environment (Q367989) (← links)
- A new solution for the Byzantine agreement problem (Q645812) (← links)
- Adaptive broadcast by fault-tolerant spanning tree switching (Q666207) (← links)
- Consensus algorithms with one-bit messages (Q757011) (← links)
- On the round complexity of Byzantine agreement without initial set-up (Q1044183) (← links)
- Modular construction of a Byzantine agreement protocol with optimal message bit complexity (Q1186809) (← links)
- Efficient agreement using fault diagnosis. (Q1312601) (← links)
- Distributed consensus revisited (Q1318741) (← links)
- Optimistically tuning synchronous Byzantine consensus: another win for null messages (Q2241306) (← links)
- The Byzantine Generals Problem in Generic and Wireless Networks (Q2926152) (← links)
- ADAPTIVE DISTRIBUTED MUTUAL EXCLUSION BY DYNAMIC TOPOLOGY SWITCHING (Q2997929) (← links)
- Player-Centric Byzantine Agreement (Q3012813) (← links)
- Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds (Q4031319) (← links)
- The Failure Discovery problem (Q4031322) (← links)
- Optimal time byzantine agreement for t <n/8 with linear-messages (Q5137009) (← links)
- Self-stabilizing Distributed Protocol Switching (Q5445751) (← links)
- On the number of authenticated rounds in Byzantine Agreement (Q6084559) (← links)
- Optimal algorithms for synchronous Byzantine \(k\)-set agreement (Q6093586) (← links)
