Communication complexity of fault-tolerant information diffusion
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 3559612 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 487720 (Why is no real title available?)
- scientific article; zbMATH DE number 857072 (Why is no real title available?)
- scientific article; zbMATH DE number 961881 (Why is no real title available?)
- A Cure for the Telephone Disease
- A Problem with Telephones
- A note on optimal time broadcast in faulty hypercubes
- Augmentation Problems
- Broadcasting and Gossiping in de Bruijn Networks
- Communication complexity of gossiping by packets
- Data communication in parallel architectures
- Efficient Gossiping by Packets in Networks with Random Faults
- Fast Gossiping by Short Messages
- Fault-tolerant broadcast graphs
- Fault-tolerant broadcasting and gossiping in communication networks
- Fault—tolerant hypercube broadcasting via information dispersal
- Further gossip problems
- Gossiping in Minimal Time
- Gossips and telephones
- Information dissemination in distributed systems with faulty units
- Kernels of minimum size gossip schemes
- Methods and problems of communication in usual networks
- Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
- Note on optimal gossiping in some weak-connected graphs
- On Gossiping with Faulty Telephone Lines
- On the communication complexity of polling
- On the minimal synchronism needed for distributed consensus
- Parallel Information Dissemination by Packets
- Reliable broadcasting
- Reordered gossip schemes
- Sequential information dissemination by packets
- Telephone Problems with Failures
- The Communication Complexity of Atomic Commitment and of Gossiping
- The communication problem on graphs
- Tighter time bounds on fault-tolerant broadcasting and gossiping
- Time bounds on fault‐tolerant broadcasting
Cited in
(6)- On the Communication Surplus Incurred by Faulty Processors
- The cost of fault tolerance in multi-party communication complexity
- Concurrent multicast in weighted networks
- Concurrent multicast in weighted networks
- The cost of fault tolerance in multi-party communication complexity
- Deterministic Models of Communication Faults
This page was built for publication: Communication complexity of fault-tolerant information diffusion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1274923)
