Prof. Christian Lavault

LIPN (CNRS UMR 7030)

Université Paris 13, Villetaneuse, France

Professor emeritus

E-mail: lavault@lipn.univ-paris13.fr

Qualifications

1987 Ph.D., Université Paris 11, France

1975 M.Sc., Université Paris 11, France

1971 B.Sc., University of Paris 11, France

Publications (Selected)

Journals

1. Lavault C.: Multiplicate inverse forms of terminating hypergeometric series, Integral Transform and Special Functions, Taylor & Francis Online, to appear (2014).
2. Lavault C: A note on Prüfer-like coding and counting forests of uniform hypertrees, J. of Discrete Algorithms, 12(1):29--36, 2012.
3. Duchamp G.H.E., Lavault C., Hoang Ngoc Minh V., Solomon A.I.: An interface between physics and number theory, hal-00531100 – v.3, 2010.
4. Janson S., Lavault C., Louchard G.: Convergence of some leader election algorithms, Discrete Mathematics and Theoretical Computer Science, 10(3):171--196, OJS 2008.
5. Lavault C., Valencia-Pabon M.: A distributed approximation algorithm for the minimum degree minimum weight spanning tree, Journal of Parallel and Distributed Computing, 68(2):200--208, 2008.
6. Lavault C., Marckert J.-F., Ravelomanana V.: Quasi-Optimal Leader Election Algorithms in Radio Networks, Information and Computation, 205(5):679--693, 2007.
7. Lavault C., Louchard G.: Asymptotic Analysis of a Leader Election Algorithm, Theoretical Computer Science, 359:239--254, Elsevier, 2006.
8. Bui M., Butelle F., Lavault C.: A Distributed Algorithm for Constructing a Minimum Diameter Spanning Tree, Journal of Parallel and Distributed Computing, 64 (5): 571--577, Elsevier, 2004.
9. Lavault C., Sedjelmaci S.M.: Improvements on the Accelerated Integer GCD Algorithm, Information Processing Letters, 61(1): 31-36, North-Holland, 1999.
10. Lavault C.: Exact Average Message Complexity Values for Distributed Election on Bidirectional Rings of Processors, Theoretical Computer Science, 73: 61--79, North-Holland, 1990.

Refereed Conference Publications

1. Lavault C.: Prüfer--like coding and counting forests of uniform hypertrees, Proc. of the 8th International Conference on Computer Science and Information Technologies, p. 82--85, 2011.
2. Lavault C.: Asymptotic analysis and convergence of some leader election algorithms, Proceedings of the 3rd Int. Conf. on Complex Systems and Application, Special Session: Combinatorics, Physics and Complexity, p. 27--34, 2009.
3. Lavault C, Paillard G., Franca F., A distributed prime sieving algorithm based on SMER, Proc. of the 4th International Symposium on Parallel and Distributed Computing, p. 139—146.
4. Lavault C.: Interconnection Networks: Graph- and Group Theoretic Modelling, Proceedings of the 12th International Conference on Control Systems and Computer Science, LNCS, p. 77-88, 1998.
5. Lavault C.: Analysis of an Efficient Distributed Algorithm for Mutual Exclusion.
6. (Average-Case Analysis of Path Reversal), Proceedings of the 2nd Joint Int. Conference on Vector and Parallel Processing, LNCS 486, p. 41-56, 1992.

Invited Conference Publications

1. Lavault C.: A note on an extension of Prüfer's encoding for a forest of uniform hypertrees, Algorithms and Complexity in Durham (ACiD 2010), 2010.
2. Lavault C.: Quantum & Combinatorics, Analysis of Leader Election Algorithms, Zakopane, Poland, 2009.
3. Lavault C.: Random Geometric Graphs and the Initialization Problem for Wireless Networks, Proceedings of the 1st Advanced Research Workshop on Information Security in Wireless Networks (NATO Security through Science Series D), 13:18--51, 2006.

Books, Book Chapters, Dissertation

1. Lavault C.: Evaluation des algorithmes distribués -- analyse, complexité,
2. méthodes, 480 pages, eds. Hermès Science, Paris, 1995.
3. Lavault C.: Encyclopedia of Computer Science and Technology, vol. 27:61--74, eds. A.  Kent et J.G. Williams, Dekker, 1993.

Profile details

http://www-lipn.univ-paris13.fr/~lavault