Pages that link to "Item:Q1286820"
From MaRDI portal
The following pages link to Complexity and approximations for multimessage multicasting (Q1286820):
Displaying 12 items.
- The power of multimedia: Combining point-to-point and multi-access networks (Q582899) (← links)
- Complexity of pairwise shortest path routing in the grid (Q703544) (← links)
- On multicast algorithms for heterogeneous networks of workstations (Q1394957) (← links)
- Broadcasting multiple messages in the 1-in port model in optimal time (Q1631684) (← links)
- An approximation algorithm for the directed telephone multicast problem (Q2505499) (← links)
- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery (Q2868642) (← links)
- Combinatorial Message Sharing and a New Achievable Region for Multiple Descriptions (Q2977002) (← links)
- ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS (Q5249291) (← links)
- Trade-Offs between Latency, Complexity, and Load Balancing with Multicast Algorithms (Q5280809) (← links)
- Minimizing message complexity of partially replicated data on hypercubes (Q5689820) (← links)
- Simple algorithms for multimessage multicasting with forwarding (Q5943661) (← links)
- A note on the message complexity of Cidon's distributed depth-first search algorithm (Q6163898) (← links)
