Effective systolic algorithms for gossiping in cycles and two-dimensional grids
From MaRDI portal
(Redirected from Publication:5055899)
Recommendations
- The complexity of systolic dissemination of information in interconnection networks
- Optimal algorithms for broadcast and gossip in the edge-disjoint modes
- The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width
- Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs
- Optimal algorithms for dissemination of information in some interconnection networks
Cites work
- scientific article; zbMATH DE number 3911718 (Why is no real title available?)
- scientific article; zbMATH DE number 3692664 (Why is no real title available?)
- scientific article; zbMATH DE number 857072 (Why is no real title available?)
- A survey of gossiping and broadcasting in communication networks
- Gossiping in Minimal Time
- Methods and problems of communication in usual networks
- Note on optimal gossiping in some weak-connected graphs
- On real-time cellular automata and trellis automata
- Parallel algorithms for gossiping by mail
- Periodic gossiping on trees
- Systolic automata for VLSI on balanced trees
- Systolic trellis automatata †
- The complexity of systolic dissemination of information in interconnection networks
- Traffic-light scheduling on the grid
Cited in
(2)
This page was built for publication: Effective systolic algorithms for gossiping in cycles and two-dimensional grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055899)
