The power of multimedia: Combining point-to-point and multi-access networks

DOI10.1016/0890-5401(90)90035-GMaRDI QIDQ582899zbMATH OpenOpenAlexFDO

Authors Yehuda Afek, Gad M. Landau, Baruch Schieber, Moti 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

zbMATH Keywords

networklower boundsmessage passingmulti-access channel

Mathematics Subject Classification ID

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)

Recommendations

• Broadcasting spanning forests on a multiple-access channel
• scientific article; zbMATH DE number 1775430
• Complexity and approximations for multimessage multicasting
• Communication-efficient parallel algorithms for distributed random-access machines
• Distributed algorithms for finding centers and medians in networks

Cites work

• A Distributed Algorithm for Minimum-Weight Spanning Trees
• Complexity of network synchronization
• Deterministic coin tossing with applications to optimal parallel list ranking
• Distributed network protocols
• 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
• Trade-Offs between Depth and Width in Parallel Computation
• Tree algorithms for packet broadcast channels

Cited in

(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

This page was built for publication: The power of multimedia: Combining point-to-point and multi-access networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582899)