Pages that link to "Item:Q1602698"
From MaRDI portal
The following pages link to Verifiable broadcasting and gossiping in communication networks (Q1602698):
Displaying 9 items.
- Epistemic protocols for dynamic gossip (Q504511) (← links)
- Information-theoretic broadcast with dishonest majority for long messages (Q1629421) (← links)
- Improved Bounds for Minimum Fault-Tolerant Gossip Graphs (Q3104777) (← links)
- Broadcasting and Gossiping in de Bruijn Networks (Q4286237) (← links)
- (Q5015383) (← links)
- New bounds on the minimum number of calls in failure‐tolerant gossiping (Q5191126) (← links)
- Fault-tolerant broadcasting and gossiping in communication networks (Q5689809) (← links)
- Algorithms - ESA 2003 (Q5897261) (← links)
- Who started this rumor? Quantifying the natural differential privacy of gossip protocols (Q6535005) (← links)