2 citations · 4 across the 13 of their papers we have counts for
17 papers
A Simple Construction of Locally Checkable Problems Filling the LOCAL Complexity Gaps in Graphs with Arbitrary Large Degrees
Filippo Casagrande, Pierre Fraigniaud, Benjamin Jauregui +1
We show that the complexity gaps in the round complexities of locally checkable labeling (LCL) problems are not due to the fact that solutions to LCL problems must be locally check…
When Should You Wait Before Updating? Toward a Robustness Refinement
Swan Dubois, Laurent Feuilloley, Franck Petit +1
Consider a dynamic network and a given distributed problem. At any point in time, there might exist several solutions that are equally good with respect to the problem specificatio…
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…
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…
Short and local transformations between ()-colorings
Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich +1
Recoloring a graph is about finding a sequence of proper colorings of this graph from an initial coloring to a target coloring . Adding the constraint that each pair of cons…
Distributed recoloring of interval and chordal graphs
Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich +1
One of the fundamental and most-studied algorithmic problems in distributed computing on networks is graph coloring, both in bounded-degree and in general graphs. Recently, the stu…