Efficient computation in congested anonymous dynamic networks

DOI10.1007/S00446-025-00481-ZMaRDI QIDQ6954067zbMATH OpenFDO

Authors Giuseppe Antonio Di Luna, G. Viglietta

Publication date 24 July 2025

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/11573/1744942

zbMATH Keywords

anonymous dynamic networkcongested networkhistory tree

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Distributed algorithms (68W15)

Cites work

• A Lower Bound for Distributed Averaging Algorithms on the Line Graph
• A self-stabilizing transformer for population protocols with covering
• Assigning labels in unknown anonymous networks (extended abstract)
• Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks
• Comparison of initial conditions for distributed algorithms on anonymous networks
• Computing in anonymous dynamic networks is linear
• Convergence speed in distributed consensus and averaging
• Coordinated consensus in dynamic networks
• Decentralised minimum-time consensus
• Distributed computation in dynamic networks
• Distributed Computing: A Locality-Sensitive Approach
• Fast computation by population protocols with a leader
• Gradient clock synchronization in dynamic networks
• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• Linear time average consensus and distributed optimization on fixed graphs
• Lower bounds on information dissemination in dynamic networks
• Naming and counting in anonymous unknown dynamic networks
• On Distributed Averaging Algorithms and Quantization Effects
• On the complexity of information spreading in dynamic networks
• Polynomial anonymous dynamic distributed computing without a unique leader
• Polynomial anonymous dynamic distributed computing without a unique leader
• Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations
• Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations
• Population protocols with faulty interactions: the impact of a leader
• Shortest, fastest, and foremost broadcast in dynamic networks
• Space-optimal counting in population protocols
• Sublinear algorithms in \(T\)-interval dynamic networks
• The total s-energy of a multiagent system
• Time and space optimal counting in population protocols

This page was built for publication: Efficient computation in congested anonymous dynamic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6954067)