**Publications (Publish or Perish?)**

A note on Prüfer-like coding and counting forests of uniform hypertrees
C. Lavault, Journal of Discrete Algorithms (Special Issue, Conf. ACiD 2010), vol. 12(1):29-36, 2012.
Version étendue : [arXiv:1110.0204] [pdf]
Efficient Location Training Protocols for Heterogeneous Sensor and Actor Networks
F. Barsi, A.A. Bertossi, C. Lavault, A. Navarra, S. Olariu, C.M. Pinotti, V. Ravelomanana, IEEE Trans on Mobile Computing, vol. 10(3):377-391, 2011.
[hal-00650540] [ps] [pdf]
Convergence of some leader election algorithms
S. Janson, C. Lavault, G. Louchard, Discrete Mathematics and Theoretical Computer Science, vol. 10(3):171-196, OJS, 2008.
[arXiv:0802.1389] [ps] [pdf]
Random Geometric Graphs and the Initialization Problem for Wireless Networks
C. Lavault, S. Olariu, V. Ravelomanana, Proc. of the 1st Advanced Research Workshop on Information Security in Wireless Networks (ARW),
NATO-SS Series D, vol. 13:18-51, éd. IOS Press, 2008.
[hal-00084612] [ps] [pdf]
A distributed approximation algorithm for the minimum degree minimum weight spanning trees
C. Lavault, M. Valencia-Pabon, Journal of Parallel and Distributed Computing, vol. 68(2):200-208, Elsevier 2008.
[arXiv:cs/0607031] [ps] [pdf]
Quasi-Optimal Energy-Efficient Leader Election Algorithms in Radio Networks
C. Lavault, J.-F. Marckert, V. Ravelomanana, Information and Computation, vol. 205(5):679-693, Elsevier 2007.
[arXiv:cs/0607034] [ps] [pdf]
Asymptotic Analysis of a Leader Election Algorithm
C. Lavault, G. Louchard, Theoretical Computer Science, vol. 359:239-254, Elsevier, 2006.
[arXiv:cs/0607032] [ps] [pdf]
A Distributed Prime Sieving Algorithm Based on SMER
G. Paillard, C. Lavault, F. Franca, Scalable Computing Practice and Experience (Special Issue -- Selected papers from the ISPDC'05 Conference), vol. 3(8):61-69, 2006.
[hal-00084606] [pdf]
An Energy-Efficient Initialization Algorithm for Random Radio Networks
B. T. Doan, C. Lavault, S. Olariu, V. Ravelomanana, Proc. of the 4th IEEE RIVF´2006, 121-139, 2006.
[hal-00084612] [pdf]
A Distributed Algorithm for Constructing a Minimum Diameter Spanning Tree
M. Bui, F. Butelle, C. Lavault, Journal of Parallel and Distributed Computing, vol. 64(5):571-577, 2004.
[hal-00465670] [pdf]
Assigning Codes in a Random Wireless Network
F. Djerourou, C. Lavault, G. Paillard, V. Ravelomanana, Proc. IEEE ICT´2004, LNCS 3124:348-353, 2004.
[ps] [pdf]
Quasi-Optimal Leader Election Algorithms in Radio Networks with Log-logarithmic Awake Time Slots
C. Lavault, J.F. Marckert, V. Ravelomanana, Proc. IEEE ICT´2003, vol. 2:1113-1119, 2003.
[arXiv:cs/0607028] [pdf]
Embeddings into the Pancake Interconnection Network
C. Lavault, Parallel Processing Letters, vol. 12(3-4):297-310, World Scientific, 2002.
[arXiv:cs/0411095] [ps] [pdf]
Reliable Self-Stabilizing Communication for Quasi Rendezvous
C. Johnen, I. Lavallée, C. Lavault, Studia Informatica, vol. 1(1):59-762, 2002.
[arXiv:1005.5630] [ps] [pdf]
Fair and Reliable Self-Stabilizing Communication
C. Johnen, I. Lavallée, C. Lavault, Parallel Processing Letters, vol. 10(2):51-59, World Scientific, 2000.
[hal-00465661] [ps]
Interconnection Networks: Graph- and Group-Theoretic Modelling
C. Lavault, Proc. CSCS12, vol. 2:207-214, 1999.
[hal-00461923] [ps] [pdf]
Worst-Case Analysis of Weber´s Algorithm
C. Lavault, S. M. Sedjelmaci, Information Processing Letters, vol. 72(3-4):125-130, North-Holland, 1999.
[ps] [pdf]
A New Modular Division Algorithm and Applications
S. M. Sedjelmaci, C. Lavault, Proc. ICTCS´98, 65-76, World Scientific, 1998.
[ps]
A Self-Stabilizing Communication Primitive
C. Johnen et I. Lavallée, C. Lavault, Proc. OPODIS´98 (invited paper), 15-23, Hermès, 1998.
[hal-00465672] [ps]
On the Hierarchy of Functioning Rules in Distributed Computing
A. Bui, M. Bui, C. Lavault, RAIRO Op. Res., vol. 33(1):15-27, EDP Science, 1999.
[hal-00465667] [pdf]
A Distributed Algorithm for the Minimum Diameter Spanning Tree Problem
F. Butelle, C. Lavault Proc. OPODIS´98, 77-88, Hermès, 1998.
[hal-00465670] [ps] [pdf]
Improvements on the Accelerated Integer GCD Algorithm
S. M. Sedjelmaci, C. Lavault, Information Processing Letters, vol. 61(1):31-36, North-Holland, 1997.
[ps]
The Diameter of the Pancake Network - Open Problems
C. Lavault, Proc. SIROCCO´96, 335-336, Carleton Un. Press, 1997.
[pdf]
Distributed Computing on Faulty Anonymous Hypercubes
C. Lavault, N. Santoro, Distributed Computing, vol. 5(8):175-190, 1996.
Distributed String Matching on the N-Cube
C. Lavault, F. Moussouni, Proc. EuroPar´96, LNCS 1123:832-835, Springer-Verlag, 1996.
An N-cube String Matching Algorithm with Long Texts
F. Moussouni, C. Lavault, Proc. CCS´95, LNCS 1120:328-340, Springer-Verlag, 1996.
A Simple Distributed Algorithm for the (Δ+1)-Coloring of Arbitrary Anonymous Networks
A. Calabrese, C. Lavault, Proc. WDAG´96, LNCS 1151:123-140, Springer-Verlag, 1996.
A Uniform Self-Stabilizing Minimum Diameter Spanning Tree Algorithm
F. Butelle, M. Bui, C. Lavault, Proc. WDAG´95, LNCS 972:257-272, Springer-Verlag, 1995.
[ps] [pdf]
Orientation of Distributed Networks: Graph- and Group-Theoretic Modelling
C. Lavault, Proc. SIROCCO´94, 49-69, Carleton Un. Press, 1995.
[hal-00461923] [pdf]
On The Hierarchy of Functioning Rules in Distributed Computing
A. Bui, M. Bui, C. Lavault, Proc. EURO XIII, IFORS:57, 1994.
[pdf]
Optimization and Performance Evaluation of Distributed Algorithms
A. Bui, C. Lavault, Proc. ECCO VI, IFORS:11, 1993.
Upper and Lower Bounds for Leader Election in Complete Networks
C. Lavault, G. Singh, Information Processing Letters, vol. 45(3):147-152, North-Holland, 1993.
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
C. Lavault, Proc. CONPAR´92-VAPP V, LNCS 634:133-144, Springer-Verlag, 1992.
[arXiv:cs/0611098] [ps] [pdf]
Spanning Tree Construction for Nameless Networks
I. Lavallée, C. Lavault, Proc. WDAG´91, LNCS 486:41-56, Springer-Verlag, 1991.
[ps] [pdf] Version étendue : [pdf]
Exact Average Message Complexity Values for Distributed Election on Bidirectional Rings of Processors
C. Lavault, Theoretical Computer Science, 73:61-79, North-Holland, 1990.
[hal-00464403] [pdf]
Constructing Spanning Trees in Anonymous Networks
C. Lavault, S. Zaks, Proc. ACM PODC´89, 319-328, ACM Press, 1989.
Average Number of Messages for Distributed Leader Finding on Rings of Processors
C. Lavault, Information Processing Letters, vol. 30:167-176, North-Holland, 1989.

Average Number of Messages for Distributed Leader Finding in Rings of Processors
C. Lavault, Proc. STACS89, LNCS 349:269-281, Springer-Verlag, 1989.
[hal-00464399]

Livre

Évaluation des algorithmes distribués -- analyse, complexité, méthodes

(Vous pouvez encore vous empresser d´en commander les derniers exemplaires à la librairie Lavoisier ou encore sur Amazon ou sur alapage, etc.)