The following pages link to Telephone Problems with Failures (Q3699732):
Displaying 17 items.
- Robust gossiping with an application to consensus (Q856404) (← links)
- Rapid almost-complete broadcasting in faulty networks (Q1008737) (← links)
- 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)
- Reliable broadcasting (Q1339885) (← 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)
- On Gossiping with Faulty Telephone Lines (Q3029035) (← links)
- Improved Bounds for Minimum Fault-Tolerant Gossip Graphs (Q3104777) (← links)
- FAST BROADCASTING WITH BYZANTINE FAULTS (Q3421854) (← links)
- (Q3487440) (← links)
- Sparse networks supporting efficient reliable broadcasting (Q4630277) (← links)
- Token transfer in a faulty network (Q4858837) (← links)
- New bounds on the minimum number of calls in failure‐tolerant gossiping (Q5191126) (← links)
