Pages that link to "Item:Q1339882"

The following pages link to Optimal algorithms for dissemination of information in generalized communication modes (Q1339882):

Displaying 22 items.

• Optimal algorithms for dissemination of information in some interconnection networks (Q1261287) (← links)
• Optimal algorithms for broadcast and gossip in the edge-disjoint modes (Q1357008) (← links)
• Minimum-cost line broadcast in paths (Q1363771) (← links)
• Minimum-time multidrop broadcast (Q1392528) (← links)
• Line broadcasting in cycles (Q1392536) (← links)
• The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width (Q1392537) (← links)
• Efficient collective communciation in optical networks (Q1575944) (← links)
• Optimal broadcasting and gossiping in one-port meshes of trees with distance-insensitive routing (Q1605472) (← links)
• On linear-time data dissemination in dynamic rooted trees (Q1727754) (← links)
• (Q3408760) (← links)
• A trade-off between information and communication in broadcast protocols (Q3474265) (← links)
• Efficient Information Exchange in the Random Phone-Call Model (Q3587433) (← links)
• The complexity of systolic dissemination of information in interconnection networks (Q4365016) (← links)
• (Q4429298) (← links)
• Determining Optimal Rates for Communication for Omniscience (Q4566753) (← links)
• On the Global Optimality of Whittle’s Index Policy for Minimizing the Age of Information (Q5030309) (← links)
• Optimal algorithms for broadcast and gossip in the edge-disjoint path modes (Q5054763) (← links)
• The relationship between gossiping in vertex-disjoint paths mode and bisection width (Q5096906) (← links)
• Universal protocols for information dissemination using emergent signals (Q5230279) (← links)
• Order optimal information spreading using algebraic gossip (Q5891123) (← links)
• Communication in the two-way listen-in vertex-disjoint paths mode (Q5941562) (← links)
• Optimal Broadcast with Partial Knowledge (Q6062521) (← links)