scientific article; zbMATH DE number 15364
From MaRDI portal
Publication:3972008
Recommendations
Cited in
(21)- Quick gossiping by telegraphs
- Methods and problems of communication in usual networks
- Note on optimal gossiping in some weak-connected graphs
- Gossiping and broadcasting versus computing functions in networks.
- Lower bounds on systolic gossip
- Gossiping with multiple sends and receives
- Lossy gossip and composition of metrics
- Information flows on hypergraphs
- On Gossiping with Faulty Telephone Lines
- Quick Gossiping by Conference Calls
- scientific article; zbMATH DE number 3849231 (Why is no real title available?)
- scientific article; zbMATH DE number 3979080 (Why is no real title available?)
- scientific article; zbMATH DE number 4059434 (Why is no real title available?)
- Gossiping in Minimal Time
- scientific article; zbMATH DE number 166936 (Why is no real title available?)
- Fast Gossiping by Short Messages
- scientific article; zbMATH DE number 1756018 (Why is no real title available?)
- Gossiping and broadcasting versus computing functions in networks
- scientific article; zbMATH DE number 4189783 (Why is no real title available?)
- Gossiping in vertex-disjoint paths mode in interconnection networks
- A class of solutions to the gossip problem. III
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3972008)