Anonymous networks

DOI10.1145/2611462.2611478zbMath1321.68463OpenAlexW2030160771MaRDI QIDQ2943614

Yuval Emek, Christoph Pfister, Roger Wattenhofer, Jochen Seidel

Publication date: 3 September 2015

Published in: Proceedings of the 2014 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2611462.2611478

zbMATH Keywords

derandomizationanonymous networks2-hop coloring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Randomized algorithms (68W20) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (6)

Node labels in local decision ⋮ Design patterns in beeping algorithms: examples, emulation, and analysis ⋮ Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs ⋮ On mobile agent verifiable problems ⋮ The Synergy of Finite State Machines ⋮ Topology recognition with advice

This page was built for publication: Anonymous networks