@inproceedings{622d456f9a9249a9af5847f870d33c07,

title = "Anonymous networks: Randomization = 2-hop coloring",

abstract = "This paper considers the computational power of anonymous message passing algorithms (henceforth, anonymous algorithms), i.e., distributed algorithms operating in a network of unidentified nodes. We prove that every problem that can be solved (and verified) by a randomized anonymous algorithm can also be solved by a deterministic anonymous algorithm provided that the latter is equipped with a 2-hop coloring of the input graph. Since the problem of 2-hop coloring a given graph (i.e., ensuring that two nodes with distance at most 2 have different colors) can by itself be solved by a randomized anonymous algorithm, it follows that with the exception of a few mock cases, the execution of every randomized anonymous algorithm can be decoupled into a generic preprocessing randomized stage that computes a 2-hop coloring, followed by a problem-specific deterministic stage. The main ingredient of our proof is a novel simulation method that relies on some surprising connections between 2-hop colorings and an extensively used graph lifting technique.",

keywords = "2-Hop coloring, Anonymous networks, Derandomization",

author = "Yuval Emek and Christoph Pfister and Jochen Seidel and Roger Wattenhofer",

year = "2014",

doi = "10.1145/2611462.2611478",

language = "אנגלית",

isbn = "9781450329446",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

pages = "96--105",

booktitle = "PODC 2014 - Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing",

note = "2014 ACM Symposium on Principles of Distributed Computing, PODC 2014 ; Conference date: 15-07-2014 Through 18-07-2014",

}