Optimal multiple message broadcasting in telephone-like communication systems
From MaRDI portal
Recommendations
- An optimal algorithm for broadcasting multiple messages in trees
- Multiple message broadcasting in the postal model
- Multi-messages broadcasting in simultaneously send/receive communication networks
- Broadcasting multiple messages in simultaneous send/receive systems
- scientific article; zbMATH DE number 1156592
Cites work
- scientific article; zbMATH DE number 3713780 (Why is no real title available?)
- A survey of gossiping and broadcasting in communication networks
- Broadcast Time in Communication Networks
- Broadcasting multiple messages in simultaneous send/receive systems
- Designing broadcasting algorithms in the postal model for message-passing systems
- Efficient parallel communication with the nCUBE 2S processor
- Multiple message broadcasting in communication networks
- Multiple message broadcasting in the postal model
Cited in
(19)- Joint transmission of vocal messages and data via digital channels of wideband communication networks: efficiency estimation algorithms
- All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
- On linear-time data dissemination in dynamic rooted trees
- Designing broadcasting algorithms in the postal model for message-passing systems
- Optimal scheduling of peer-to-peer file dissemination
- Optimal broadcast for fully connected processor-node networks
- Time-optimal broadcasting of multiple messages in 1-in port model
- Optimal point-to-point broadcast algorithms via lopsided trees
- Modelling simultaneous broadcasting by level-disjoint partitions
- Three messages are not optimal in worst case interactive communication
- Broadcasting multiple messages in simultaneous send/receive systems
- Efficient Information Exchange in the Random Phone-Call Model
- All-to-all broadcast problems on Cartesian product graphs
- Broadcasting a file in a communication network
- Broadcasting multiple messages in the 1-in port model in optimal time
- scientific article; zbMATH DE number 714582 (Why is no real title available?)
- New upper bound on \(m\)-time-relaxed \(k\)-broadcast graphs
- Multi-messages broadcasting in simultaneously send/receive communication networks
- Broadcast transmission to prioritizing receivers
This page was built for publication: Optimal multiple message broadcasting in telephone-like communication systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962017)
