Showing 2006 · cs.DCShow all
3 papers · 2 filters
cs.DC2006
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
Christian Lavault
The algorithm analysed by Naïmi, Trehe and Arnold was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tre…
cs.DC2006
Quasi-Optimal Leader Election Algorithms in Radio Networks with Loglogarithmic Awake Time Slots
Christian Lavault, Jean-François Marckert, Vlady Ravelomanana
A radio network (RN) is a distributed system consisting of radio stations. We design and analyze two distributed leader election protocols in RN where the number of radio s…
cs.DC2006
A distributed approximation algorithm for the minimum degree minimum weight spanning trees
Christian Lavault, Mario Valencia-Pabon
Fischer has shown how to compute a minimum weight spanning tree of degree at most in time for any constant , where $Δ^*…