Stateless Information Dissemination Algorithms

DOI10.1007/978-3-030-54921-3_11OpenAlexW3045788860MaRDI QIDQ5100958

Volker Turau

Publication date: 1 September 2022

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-54921-3_11

Mathematics Subject Classification ID

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

Related Items (3)

Amnesiac flooding: synchronous stateless information dissemination ⋮ Termination of amnesiac flooding ⋮ Synchronous concurrent broadcasts for intermittent channels with bounded capacities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clustering to minimize the maximum intercluster distance
• The shortest-path problem for graphs with random arc-lengths
• Easy and hard bottleneck location problems
• Randomized broadcast in networks
• A survey of gossiping and broadcasting in communication networks
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Distributed Computing: A Locality-Sensitive Approach
• Probabilistic Analysis of Rumor-Spreading Time
• On Termination of a Flooding Process
• Stateless Computation

This page was built for publication: Stateless Information Dissemination Algorithms