1 citations · 1 across the 8 of their papers we have counts for
8 papers · 1 filter
Self-stabilization and byzantine tolerance for maximal independent
Johanne Cohen, Laurence Pilard, François Pirot +1
We analyze the impact of transient and Byzantine faults on the construction of a maximal independent set in a general network. We adapt the self-stabilizing algorithm presented by…
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…
Self-Stabilization and Byzantine Tolerance for Maximal Independent Set
Johanne Cohen, Laurence Pilard, Jonas Sénizergues
We analyze the impact of transient and Byzantine faults on the construction of a maximal independent set in a general network. We adapt the self-stabilizing algorithm presented by…
A self-stabilizing algorithm for maximal matching in link-register model in moves
Johanne Cohen, Georges Manoussakis, Laurence Pilard +1
In the matching problem, each node maintains a pointer to one of its neighbor or to , and a maximal matching is computed when each node points either to a neighbor that itsel…
Polynomial self-stabilizing algorithm and proof for a 2/3-approximation of a maximum matching
Johanne Cohen, Khaled Maâmra, George Manoussakis +1
We present the first polynomial self-stabilizing algorithm for finding a -approximation of a maximum matching in a general graph. The previous best known algorithm has bee…
Self-Stabilizing Maximal Matching and Anonymous Networks
Johanne Cohen, Jonas Lefèvre, Khaled Maâmra +2
We propose a self-stabilizing algorithm for computing a maximal matching in an anonymous network. The complexity is moves with high probability, under the adversarial dist…
The Manne et al. self-stabilizing 2/3-approximation matching algorithm is sub-exponential
Johanne Cohen, Jonas Lefèvre, Khaled Maâmra +2
Manne et al. designed the first algorithm computing a maximal matching that is a 2/3 -approximation of the maximum matching in moves. However, the complexity tightness was…
A Distributed Clustering Algorithm for Dynamic Networks
Thibault Bernard, Alain Bui, Laurence Pilard +1
We propose an algorithm that builds and maintains clusters over a network subject to mobility. This algorithm is fully decentralized and makes all the different clusters grow concu…