A faster exact-counting protocol for anonymous dynamic networks
From MaRDI portal
Publication:1755728
DOI10.1007/s00453-017-0367-4zbMath1410.68047OpenAlexW3021008771MaRDI QIDQ1755728
Miguel A. Mosteiro, Maitri Chakraborty, Alessia Milani
Publication date: 11 January 2019
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-017-0367-4
Graph theory (including graph drawing) in computer science (68R10) Network protocols (68M12) Distributed algorithms (68W15)
Related Items (2)
Polynomial anonymous dynamic distributed computing without a unique leader ⋮ Polynomial anonymous dynamic distributed computing without a unique leader
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact mixing times for random walks on trees
- An early-stopping protocol for computing aggregate functions in Sensor Networks
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
- Fault-tolerant aggregation: flow-updating meets mass-distribution
- Distributed computation in dynamic networks
- Naming and Counting in Anonymous Unknown Dynamic Networks
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
- On Distributed Averaging Algorithms and Quantization Effects
- Non Trivial Computations in Anonymous Dynamic Networks
This page was built for publication: A faster exact-counting protocol for anonymous dynamic networks
