Pages that link to "Item:Q3029035"
From MaRDI portal
The following pages link to On Gossiping with Faulty Telephone Lines (Q3029035):
Displayed 13 items.
- Broadcasting in complete networks with faulty nodes using unreliable calls (Q1183465) (← links)
- Communication complexity of fault-tolerant information diffusion (Q1274923) (← links)
- Graph theoretical issues in computer networks (Q1319540) (← links)
- Fast gossiping with short unreliable messages (Q1339876) (← links)
- Broadcasting with linearly bounded transmission faults (Q1392531) (← links)
- Verifiable broadcasting and gossiping in communication networks (Q1602698) (← links)
- Lossy gossip and composition of metrics (Q2351025) (← links)
- Reliable Broadcasting in Hypercubes with Random Link and Node Failures (Q2785368) (← links)
- Improved Bounds for Minimum Fault-Tolerant Gossip Graphs (Q3104777) (← links)
- Sparse networks supporting efficient reliable broadcasting (Q4630277) (← links)
- Token transfer in a faulty network (Q4858837) (← links)
- Communication complexity of gossiping by packets (Q5054816) (← links)
- New bounds on the minimum number of calls in failure‐tolerant gossiping (Q5191126) (← links)