Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks
From MaRDI portal
Publication:6202242
DOI10.1145/3583668.3594590arXiv2301.07849MaRDI QIDQ6202242
Giovanni Viglietta, Giuseppe Antonio Di Luna
Publication date: 26 March 2024
Published in: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2301.07849
Cites Work
- Unnamed Item
- Unnamed Item
- Decentralised minimum-time consensus
- A self-stabilizing transformer for population protocols with covering
- Gradient clock synchronization in dynamic networks
- Population protocols with faulty interactions: the impact of a leader
- Space-optimal counting in population protocols
- Polynomial anonymous dynamic distributed computing without a unique leader
- Distributed computation in dynamic networks
- Comparison of initial conditions for distributed algorithms on anonymous networks
- Coordinated consensus in dynamic networks
- Shortest, Fastest, and Foremost Broadcast in Dynamic Networks
- The Total s-Energy of a Multiagent System
- Naming and Counting in Anonymous Unknown Dynamic Networks
- Fast Computation by Population Protocols with a Leader
- Distributed Computing: A Locality-Sensitive Approach
- Linear Time Average Consensus and Distributed Optimization on Fixed Graphs
- Lower Bounds on Information Dissemination in Dynamic Networks
- On Distributed Averaging Algorithms and Quantization Effects
- Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations
- Polynomial anonymous dynamic distributed computing without a unique leader
- Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations
- Assigning labels in unknown anonymous networks (extended abstract)
- Convergence Speed in Distributed Consensus and Averaging
- A Lower Bound for Distributed Averaging Algorithms on the Line Graph
- On the Complexity of Information Spreading in Dynamic Networks
This page was built for publication: Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks