Christian Lavault
According to our database1,
Christian Lavault
authored at least 36 papers
between 1989 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
1990
1995
2000
2005
2010
2015
0
1
2
3
4
5
1
1
4
2
2
1
3
1
1
1
2
1
1
1
1
1
1
1
1
1
1
1
1
2
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2019
Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops, 2019
2015
Electron. J. Comb., 2015
2014
2013
2011
IEEE Trans. Mob. Comput., 2011
2008
A distributed approximation algorithm for the minimum degree minimum weight spanning trees.
J. Parallel Distributed Comput., 2008
Discret. Math. Theor. Comput. Sci., 2008
Proceedings of the 1st ACM International Workshop on Heterogeneous Sensor and Actor Networks, 2008
2007
Inf. Comput., 2007
2006
Quasi-Optimal Leader Election Algorithms in Radio Networks with Loglogarithmic Awake Time Slots
CoRR, 2006
A Quasi-Optimal Leader Election Algorithm in Radio Networks with Log-Logarithmic Awake Time Slots
CoRR, 2006
Proceedings of the 4th International Confernce on Computer Sciences: Research, 2006
2005
Proceedings of the 4th International Symposium on Parallel and Distributed Computing (ISPDC 2005), 2005
2004
J. Parallel Distributed Comput., 2004
Proceedings of the Telecommunications and Networking, 2004
2002
2001
Stud. Inform. Univ., 2001
2000
Fair and Reliable Self-stabilizing Communication.
Proceedings of the Procedings of the 4th International Conference on Principles of Distributed Systems, 2000
1999
RAIRO Oper. Res., 1999
1998
Distributed Algorithms for AllPairs Shortest Paths and Minimum Diameter Spanning Tree Problems.
Proceedings of the Distributed Computing, 1998
1997
Optimal Pattern Matching on dDimensional Meshes.
Proceedings of the On Principles Of Distributed Systems, 1997
1996
Proceedings of the Euro-Par '96 Parallel Processing, 1996
1995
Proceedings of the Distributed Algorithms, 9th International Workshop, 1995
Proceedings of the Combinatorics and Computer Science, 1995
1994
Orientation of Distributed Networks: Graph- and Group- Theoretic Modelling.
Proceedings of the Structural Information and Communication Complexity, 1994
1992
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal).
Proceedings of the Parallel Processing: CONPAR 92, 1992
1990
Exact Average Message Complexity Values for Distributed Election on Bidirectional Rings of Processors.
Theor. Comput. Sci., 1990
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990
1989
Inf. Process. Lett., 1989