Pages that link to "Item:Q2796282"
From MaRDI portal
The following pages link to Fault-tolerant consensus in directed graphs (Q2796282):
Displaying 15 items.
- Fault tolerant reachability for directed graphs (Q1664162) (← links)
- Crash-tolerant consensus in directed graph revisited (extended abstract) (Q1713896) (← links)
- Reaching approximate Byzantine consensus with multi-hop communication (Q2013588) (← links)
- On the computational complexity of the secure state-reconstruction problem (Q2063856) (← links)
- Randomized transmission protocols for protection against jamming attacks in multi-agent consensus (Q2184510) (← links)
- Secure consensus with distributed detection via two-hop communication (Q2665414) (← links)
- Recent Results on Fault-Tolerant Consensus in Message-Passing Networks (Q2835019) (← links)
- Network Topology and Fault-Tolerant Consensus (Q4966871) (← links)
- Global and fixed-terminal cuts in digraphs (Q5002602) (← links)
- (Q5091085) (← links)
- Reaching Approximate Byzantine Consensus with Multi-hop Communication (Q5207895) (← links)
- Synchronous \(t\)-resilient consensus in arbitrary graphs (Q6044459) (← links)
- Fast agreement in networks with Byzantine nodes (Q6535029) (← links)
- Synchronous \(t\)-resilient consensus in arbitrary graphs (Q6536327) (← links)
- Asynchronous approximate Byzantine consensus: a multi-hop relay method and tight graph conditions (Q6659191) (← links)