Optimal point-to-point broadcast algorithms via lopsided trees
From MaRDI portal
(Redirected from Publication:1296579)
Recommendations
Cites work
- scientific article; zbMATH DE number 3162350 (Why is no real title available?)
- scientific article; zbMATH DE number 2102776 (Why is no real title available?)
- A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs
- A survey of gossiping and broadcasting in communication networks
- An Elementary Approach to Some Analytic Asymptotics
- Broadcasting multiple messages in simultaneous send/receive systems
- Designing broadcasting algorithms in the postal model for message-passing systems
- Multiple message broadcasting in the postal model
- Optimal computation of census functions in the postal model
- Optimal multiple message broadcasting in telephone-like communication systems
- Optimum lopsided binary trees
- Recurrence relations based on minimization
Cited in
(4)- On searching strategies, parallel questions, and delayed answers
- Designing broadcasting algorithms in the postal model for message-passing systems
- scientific article; zbMATH DE number 1760004 (Why is no real title available?)
- scientific article; zbMATH DE number 2102776 (Why is no real title available?)
This page was built for publication: Optimal point-to-point broadcast algorithms via lopsided trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296579)