The power of multimedia: Combining point-to-point and multi-access networks
From MaRDI portal
Publication:582899
DOI10.1016/0890-5401(90)90035-GzbMath0691.68033OpenAlexW2025706935MaRDI QIDQ582899
Yehuda Afek, Gad M. Landau, Baruch Schieber, Mordechai M. Yung
Publication date: 1990
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(90)90035-g
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Channel models (including quantum) in information and communication theory (94A40)
Related Items (2)
Geometric approach for optimal routing on a mesh with buses ⋮ On the complexity of global computation in the presence of link failures: the general case
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Optimal lower bounds for some distributed algorithms for a complete network of processors
- Tree algorithms for packet broadcast channels
- Distributed network protocols
- Trade-Offs between Depth and Width in Parallel Computation
- Deterministic coin tossing with applications to optimal parallel list ranking
- Complexity of network synchronization
- A Distributed Algorithm for Minimum-Weight Spanning Trees
This page was built for publication: The power of multimedia: Combining point-to-point and multi-access networks
