2 citations · 4 across the 13 of their papers we have counts for
Showing 2022 · cs.DCShow all
2 papers · 2 filters
cs.DC2022
Making Self-Stabilizing any Locally Greedy Problem
Johanne Cohen, Laurence Pilard, Mikaël Rabie +1
We propose a way to transform synchronous distributed algorithms solving locally greedy and mendable problems into self-stabilizing algorithms in anonymous networks. Mendable probl…
cs.DC2022
Fault Tolerant Coloring of the Asynchronous Cycle
Pierre Fraigniaud, Patrick Lambein-Monette, Mikaël Rabie
We present a wait-free algorithm for proper coloring the n nodes of the asynchronous cycle , where each crash-prone node starts with its (unique) identifier as input. The algo…