Pages that link to "Item:Q1962017"
From MaRDI portal
The following pages link to Optimal multiple message broadcasting in telephone-like communication systems (Q1962017):
Displaying 17 items.
- All-to-all broadcast problem of some classes of graphs under the half duplex all-port model (Q400494) (← links)
- Optimal broadcast for fully connected processor-node networks (Q436809) (← links)
- Optimal scheduling of peer-to-peer file dissemination (Q835584) (← links)
- All-to-all broadcast problems on Cartesian product graphs (Q897889) (← links)
- Optimal and near-optimal algorithms for \(k\)-item broadcast (Q1291007) (← links)
- Optimal point-to-point broadcast algorithms via lopsided trees (Q1296579) (← links)
- Broadcasting multiple messages in simultaneous send/receive systems (Q1339400) (← links)
- Broadcasting multiple messages in the 1-in port model in optimal time (Q1631684) (← links)
- On linear-time data dissemination in dynamic rooted trees (Q1727754) (← links)
- Joint transmission of vocal messages and data via digital channels of wideband communication networks: efficiency estimation algorithms (Q1881928) (← links)
- Broadcasting a file in a communication network (Q2173055) (← links)
- Modelling simultaneous broadcasting by level-disjoint partitions (Q2279226) (← links)
- Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model (Q2958310) (← links)
- Efficient Information Exchange in the Random Phone-Call Model (Q3587433) (← links)
- Three messages are not optimal in worst case interactive communication (Q4307265) (← links)
- Designing broadcasting algorithms in the postal model for message-passing systems (Q4311639) (← links)
- New upper bound on \(m\)-time-relaxed \(k\)-broadcast graphs (Q6496344) (← links)
