The following pages link to Gossiping in Minimal Time (Q3990105):
Displaying 46 items.
- Mapping pipeline skeletons onto heterogeneous platforms (Q436791) (← links)
- Odd gossiping (Q516782) (← links)
- The minimum broadcast time problem for several processor networks (Q672455) (← links)
- An online distributed gossiping protocol for mobile networks (Q857763) (← links)
- The addition game: An abstraction of a communication problem (Q1097184) (← links)
- Optimal sequential gossiping by short messages (Q1270817) (← links)
- Communication complexity of fault-tolerant information diffusion (Q1274923) (← links)
- Fast gossiping on square mesh computers (Q1313753) (← links)
- Quick gossiping by telegraphs (Q1318840) (← 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 optimal gossiping in some weak-connected graphs (Q1342244) (← links)
- Optimal algorithms for broadcast and gossip in the edge-disjoint modes (Q1357008) (← links)
- Better bounds for perpetual gossiping (Q1363648) (← links)
- Broadcast and gossip in line-communication mode (Q1382273) (← links)
- Deterministic broadcasting time with partial knowledge of the network. (Q1401209) (← links)
- Gossiping and broadcasting versus computing functions in networks. (Q1427193) (← links)
- Efficient collective communciation in optical networks (Q1575944) (← links)
- Optimal odd gossiping (Q1671312) (← links)
- The epistemic gossip problem (Q1712508) (← links)
- Lower bounds on systolic gossip (Q1763428) (← links)
- Optimal gossiping in paths and cycles (Q1827271) (← links)
- Gossiping with multiple sends and receives (Q1917243) (← links)
- Reordered gossip schemes (Q1923510) (← links)
- A study of minimum gossip graphs (Q1974518) (← links)
- Optimal gossiping in square 2D meshes (Q2382678) (← links)
- Minimum linear gossip graphs and maximal linear \((\Delta,k)\)-gossip graphs (Q2764998) (← links)
- Reliable broadcasting in hypercubes with random link and node failures (Q2785368) (← links)
- Quick Gossiping by Conference Calls (Q3032285) (← links)
- (Q3318781) (← links)
- Fast Gossiping for the Hypercube (Q3990659) (← links)
- Fast Gossiping by Short Messages (Q4210076) (← links)
- (Q4535804) (← links)
- Oriented hypercubes (Q4537616) (← links)
- Sparse networks supporting efficient reliable broadcasting (Q4630277) (← links)
- Fast gossiping by short messages (Q4645173) (← links)
- GOSSIPING IN BUS INTERCONNECTION NETWORKS (Q4820159) (← links)
- (Q5020961) (← links)
- Gossiping and broadcasting versus computing functions in networks (Q5047171) (← links)
- Optimal algorithms for broadcast and gossip in the edge-disjoint path modes (Q5054763) (← links)
- Communication complexity of gossiping by packets (Q5054816) (← links)
- Effective systolic algorithms for gossiping in cycles and two-dimensional grids (Q5055899) (← links)
- STEADY-STATE SCHEDULING ON HETEROGENEOUS CLUSTERS (Q5315921) (← links)
- Cyclic gossiping times for some classes of graphs (Q5689808) (← links)
- Equitable total coloring of Fibonacci graphs (Q6583579) (← links)
