Computing in anonymous dynamic networks is linear

DOI10.1109/FOCS54457.2022.00108MaRDI QIDQ6942979zbMATH OpenFDO

Authors Giuseppe Antonio Di Luna, G. Viglietta

Publication date 15 August 2025

Full work available at URL https://doi.org/10.1109/FOCS54457.2022.00108

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(6)

• Anonymous adversarial dynamic networks with logarithmic memory and communication
• Efficient computation in congested anonymous dynamic networks
• Brief announcement: Know your audience. Communication model and computability in anonymous networks
• Efficient computation in congested anonymous dynamic networks
• Agreement tasks in fault-prone synchronous networks of arbitrary structure
• Memory lower bounds and impossibility results for anonymous dynamic broadcast

This page was built for publication: Computing in anonymous dynamic networks is linear

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