scientific article; zbMATH DE number 1985614

zbMath1030.90010MaRDI QIDQ4429298

Hans-Joachim Böckenhauer

Publication date: 25 September 2003

Full work available at URL: https://eudml.org/doc/23830

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

communication algorithmsparallel computationsbroadcast complexity

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Cites Work

• Optimal algorithms for dissemination of information in generalized communication modes
• Methods and problems of communication in usual networks
• Optimal algorithms for broadcast and gossip in the edge-disjoint modes
• Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs
• A survey of gossiping and broadcasting in communication networks
• Minimum-time line broadcast networks
• On the sizes of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks
• Unnamed Item

This page was built for publication: