11 citations · 17 across the 16 of their papers we have counts for
12 papers · 1 filter
Improvements on the accelerated integer GCD algorithm
Sidi Mohamed Sedjelmaci, Christian Lavault
The present paper analyses and presents several improvements to the algorithm for finding the -pairs of integers used in the -ary reduction of the right-shift -ary int…
A distributed prime sieving algorithm based on Scheduling by Multiple Edge Reversal
Gabriel Paillard, Christian Lavault, Felipe Franca
This paper presents a new distributed approach for generating all prime numbers in a given interval of integers. From Eratosthenes, who elaborated the first prime sieve (more than…
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.…
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…
A New Modular Division Algorithm and Applications
Sidi Mohamed Sedjelmaci, Christian Lavault
The present paper proposes a new parallel algorithm for the modular division , where and are positive integers . The algorithm combines th…
Reliable Self-Stabilizing Communication for Quasi Rendezvous
Colette Johnen, Ivan Lavallee, Christian Lavault
The paper presents three self-stabilizing protocols for basic fair and reliable link communication primitives. We assume a link-register communication model under read/write atomic…