## A Self-Stabilizing Algorithm for Maximal Matching in Anonymous Networks

- Johanne Cohen, Jonas Lefèvre, Khaled Maâmra, Laurence Pilard, Devan Sohier
- Parallel Processing Letters
- 2016

@inproceedings{Seidel2015RandomnessVT, title={Randomness vs. Time in Anonymous Networks}, author={Jochen Seidel and Jara Uitto and Roger Wattenhofer}, booktitle={DISC}, year={2015} }

- Published 2015 in DISC
DOI:10.1007/978-3-662-48653-5_18

In an anonymous network, symmetry breaking tasks can only be solved if randomization is available. But how many random bits are required to solve any such task? As it turns out, the answer to this question depends on the desired runtime of the algorithm. Since any randomized anonymous network algorithm can be decomposed into a randomized 2-hop coloring stage and a deterministic stage, we tackle the question by focusing on the randomized stage. We establish that for any reasonable target… CONTINUE READING

### Presentations referencing similar topics