Rapid almost-complete broadcasting in faulty networks
From MaRDI portal
Publication:1008737
DOI10.1016/j.tcs.2008.12.023zbMath1163.68007OpenAlexW1968221723MaRDI QIDQ1008737
Rastislav Královič, Richard Královič
Publication date: 30 March 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.12.023
Cites Work
- Unnamed Item
- Unnamed Item
- On the impact of sense of direction on message complexity
- On induced subgraphs of the cube
- Broadcasting in complete networks with faulty nodes using unreliable calls
- Broadcasting with linearly bounded transmission faults
- Dynamic faults have small effect on broadcasting in hypercubes.
- Optimal broadcasting in hypercubes with dynamic faults
- Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures
- On Fractional Dynamic Faults with Threshold
- Telephone Problems with Failures
- Impossibility of distributed consensus with one faulty process
- A survey of gossiping and broadcasting in communication networks
- Reaching Agreement in the Presence of Faults
- Almost Safe Gossiping in Bounded Degree Networks
- Self-stabilizing systems in spite of distributed control
- Information dissemination in distributed systems with faulty units
- Feasibility and complexity of broadcasting with random transmission failures
- Broadcasting in synchronous networks with dynamic faults
This page was built for publication: Rapid almost-complete broadcasting in faulty networks
