2 citations · 2 across the 3 of their papers we have counts for
Showing cs.DCShow all
3 papers · 1 filter
cs.DC2013
A Uniform Self-Stabilizing Minimum Diameter Spanning Tree Algorithm
Franck Butelle, Christian Lavault, Marc Bui
We present a uniform self-stabilizing algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of an arbitrary positively real-weighted graph.…
cs.DC2013
A Distributed Algorithm for Constructing a Minimum Diameter Spanning Tree
Marc Bui, Franck Butelle, Christian Lavault
We present a new algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of any (non-negatively) real-weighted graph . As an int…
cs.DC2011★ 2 cited
A Model for Coherent Distributed Memory For Race Condition Detection
Franck Butelle, Camille Coti
We present a new model for distributed shared memory systems, based on remote data accesses. Such features are offered by network interface cards that allow one-sided operations, r…