Pages that link to "Item:Q1079947"
From MaRDI portal
The following pages link to Easy impossibility proofs for distributed consensus problems (Q1079947):
Displaying 13 items.
- Synchronous \(t\)-resilient consensus in arbitrary graphs (Q6044459) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
- Phase transitions of Best‐of‐two and Best‐of‐three on stochastic block models (Q6074651) (← links)
- On the power of an honest majority in three-party computation without broadcast (Q6109073) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
- Fast agreement in networks with Byzantine nodes (Q6535029) (← links)
- Synchronous \(t\)-resilient consensus in arbitrary graphs (Q6536327) (← links)
- Player-replaceability and forensic support are two sides of the same (crypto) coin (Q6573949) (← links)
- On secure computation of solitary output functionalities with and without broadcast (Q6582168) (← links)
- Memory checking for parallel RAMs (Q6582183) (← links)
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited (Q6587962) (← links)
- Quasi-majority functional voting on expander graphs (Q6641063) (← links)
- Scalable agreement protocols with optimal optimistic efficiency (Q6660395) (← links)