The following pages link to Fast Gossiping for the Hypercube (Q3990659):
Displaying 15 items.
- Fast gossiping on square mesh computers (Q1313753) (← links)
- Graph theoretical issues in computer networks (Q1319540) (← links)
- Fast gossiping with short unreliable messages (Q1339876) (← links)
- Methods and problems of communication in usual networks (Q1339884) (← links)
- Note on the problem of gossiping in multidimensional grids (Q1339896) (← links)
- Note on optimal gossiping in some weak-connected graphs (Q1342244) (← links)
- Better bounds for perpetual gossiping (Q1363648) (← links)
- Deterministic broadcasting time with partial knowledge of the network. (Q1401209) (← links)
- Optimal gossiping in paths and cycles (Q1827271) (← links)
- Gossiping with multiple sends and receives (Q1917243) (← links)
- Optimal gossiping in square 2D meshes (Q2382678) (← links)
- Reliable broadcasting in hypercubes with random link and node failures (Q2785368) (← links)
- Fast gossiping on mesh-bus computers (Q4420815) (← links)
- Oriented hypercubes (Q4537616) (← links)
- On the oriented diameter of planar triangulations (Q6645167) (← links)