Termination of amnesiac flooding
From MaRDI portal
Publication:6099033
DOI10.1007/s00446-023-00448-yMaRDI QIDQ6099033
Publication date: 19 June 2023
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-023-00448-y
communication; network algorithms; broadcast; flooding algorithm; graph bipartiteness; process termination
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sublinear bounds for randomized leader election
- Amnesiac flooding: synchronous stateless information dissemination
- Synchronous concurrent broadcasts for intermittent channels with bounded capacities
- Does adding more agents make a difference? A case study of cover time for the rotor-router
- Distributed network protocols
- Simulating a Random Walk with Constant Error
- Distributed Computing: A Locality-Sensitive Approach
- Stateless Information Dissemination Algorithms
- On Termination of a Flooding Process
- Fast distributed random walks
- Efficient distributed random walks with applications
- Stateless Computation
- Greedy distributed optimization of multi-commodity flows
- On the Complexity of Universal Leader Election
- On the termination of flooding