Synchronous concurrent broadcasts for intermittent channels with bounded capacities

DOI10.1007/978-3-030-79527-6_17OpenAlexW3175429546MaRDI QIDQ2117736

Volker Turau

Publication date: 22 March 2022

Full work available at URL: https://arxiv.org/abs/2011.05772

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Related Items (1)

Termination of amnesiac flooding

Cites Work

• Amnesiac flooding: synchronous stateless information dissemination
• The shortest-path problem for graphs with random arc-lengths
• Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility
• Distributed Computing: A Locality-Sensitive Approach
• Stateless Information Dissemination Algorithms
• Probabilistic Analysis of Rumor-Spreading Time
• On Termination of a Flooding Process

This page was built for publication: Synchronous concurrent broadcasts for intermittent channels with bounded capacities