Pages that link to "Item:Q4732294"
From MaRDI portal
The following pages link to Time bounds on fault‐tolerant broadcasting (Q4732294):
Displaying 21 items.
- Binary linear programming models for robust broadcasting in communication networks (Q266832) (← links)
- Tight bounds for FEC-based reliable multicast (Q598189) (← links)
- Communication complexity of fault-tolerant information diffusion (Q1274923) (← links)
- Graph theoretical issues in computer networks (Q1319540) (← links)
- On optimal broadcasting in faulty hypercubes (Q1339875) (← links)
- Reliable broadcasting (Q1339885) (← links)
- Minimum time broadcast in faulty star networks (Q1392530) (← links)
- Broadcasting with linearly bounded transmission faults (Q1392531) (← links)
- Optimal broadcasting in faulty trees (Q1577006) (← links)
- Verifiable broadcasting and gossiping in communication networks (Q1602698) (← links)
- Communication-efficient broadcasting in complete networks with dynamic faults (Q1762999) (← links)
- A note on optimal time broadcast in faulty hypercubes (Q1892869) (← links)
- Fault-tolerant broadcasting in radio networks (Q2731601) (← links)
- Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures (Q3128191) (← links)
- FAST BROADCASTING WITH BYZANTINE FAULTS (Q3421854) (← links)
- Tighter time bounds on fault-tolerant broadcasting and gossiping (Q4014613) (← links)
- Fault-Tolerant Broadcasting on the Arrangement Graph (Q4226636) (← links)
- A note on broadcasting with linearly bounded transmission faults in constant degree networks (Q5055930) (← links)
- Fault-tolerant minimum broadcast networks (Q5689764) (← links)
- Broadcasting in synchronous networks with dynamic faults (Q5689765) (← links)
- Time-relaxed 1-fault tolerant broadcast networks (Q6483537) (← links)
