Pages that link to "Item:Q4014611"
From MaRDI portal
The following pages link to Reliable communication in networks with Byzantine link failures (Q4014611):
Displaying 13 items.
- Almost-everywhere secure computation with edge corruptions (Q901366) (← links)
- Fast gossiping with short unreliable messages (Q1339876) (← links)
- Reliable broadcasting in product networks (Q1392523) (← links)
- Verifiable broadcasting and gossiping in communication networks (Q1602698) (← links)
- Making asynchronous distributed computations robust to noise (Q2010600) (← links)
- Expected reliability of communication protocols (Q2317660) (← links)
- Probabilistic reliability and privacy of communication using multicast in general neighbor networks (Q2425532) (← links)
- Making Asynchronous Distributed Computations Robust to Channel Noise (Q4993319) (← links)
- Broadcasting in hypercubes with randomly distributed Byzantine faults (Q6084558) (← links)
- Distributed computations in fully-defective networks (Q6091854) (← links)
- Reliable broadcast in dynamic networks with locally bounded Byzantine failures (Q6165837) (← links)
- Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn (Q6488432) (← links)
- Broadcasting in star graphs with Byzantine failures (Q6560361) (← links)