Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures
From MaRDI portal
Publication:3128191
DOI10.1006/JAGM.1996.0810zbMATH Open0866.68011OpenAlexW2061408752MaRDI QIDQ3128191FDOQ3128191
Authors: Piotr Berman, Krzryztof Diks, Andrzej Pelc 
Publication date: 20 May 1997
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1996.0810
Recommendations
Cited In (19)
- Feasibility and complexity of broadcasting with random transmission failures
- \(f\)-sensitivity distance oracles and routing schemes
- Broadcasting with random faults
- Reliable communication in networks with Byzantine link failures
- Byzantine broadcast in point-to-point networks using local linear coding
- Rapid almost-complete broadcasting in faulty networks
- Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn
- Broadcasting in complete networks with faulty nodes using unreliable calls
- Scalable eventually consistent counters over unreliable networks
- Sparse networks supporting efficient reliable broadcasting
- Reliable broadcast in dynamic networks with locally bounded Byzantine failures
- Almost-everywhere secure computation with edge corruptions
- Time-relaxed 1-fault tolerant broadcast networks
- Broadcasting with locally bounded byzantine faults
- On fractional dynamic faults with thresholds
- Making Asynchronous Distributed Computations Robust to Channel Noise
- FAST BROADCASTING WITH BYZANTINE FAULTS
- Deterministic Models of Communication Faults
- Scalable Byzantine reliable broadcast
This page was built for publication: Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3128191)
