3 papers
cs.DC2018
Some Problems in Compact Message Passing
Armando Castañeda, Jonas Lefèvre, Amitabh Trehan
This paper seeks to address the question of designing distributed algorithms for the setting of compact memory i.e. sublinear bits working memory for arbitrary connected networks.…
cs.DC2016
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…
cs.DC2016
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…