 | 2008 |
|---|
| 31 |       | Ferruccio Barsi,
Alfredo Navarra,
Maria Cristina Pinotti,
Christian Lavault,
Vlady Ravelomanana,
Stephan Olariu,
Alan A. Bertossi:
Efficient binary schemes for training heterogeneous sensor and actor networks.
HeterSanet 2008: 17-24 |
| 30 | | Svante Janson,
Christian Lavault,
Guy Louchard:
Convergence of some leader election algorithms
CoRR abs/0802.1389: (2008) |
| 29 | | Svante Janson,
Christian Lavault,
Guy Louchard:
Convergence of Some Leader Election Algorithms.
Discrete Mathematics & Theoretical Computer Science 10(3): (2008) |
| 28 | | Christian Lavault,
Mario Valencia-Pabon:
A distributed approximation algorithm for the minimum degree minimum weight spanning trees.
J. Parallel Distrib. Comput. 68(2): 200-208 (2008) |
| 2007 |
|---|
| 27 | | Christian Lavault,
Jean-François Marckert,
Vlady Ravelomanana:
Quasi-optimal energy-efficient leader election algorithms in radio networks.
Inf. Comput. 205(5): 679-693 (2007) |
| 2006 |
|---|
| 26 | | Binh Thanh Doan,
Christian Lavault,
Stephan Olariu,
Vlady Ravelomanana:
An energy-efficient initialization algorithm for random radio networks.
RIVF 2006: 126-132 |
| 25 | | Christian Lavault,
Jean-François Marckert,
Vlady Ravelomanana:
A Quasi-Optimal Leader Election Algorithm in Radio Networks with Log-Logarithmic Awake Time Slots
CoRR abs/cs/0607028: (2006) |
| 24 | | Christian Lavault,
Mario Valencia-Pabon:
A distributed approximation algorithm for the minimum degree minimum weight spanning trees
CoRR abs/cs/0607031: (2006) |
| 23 | | Christian Lavault,
Guy Louchard:
Asymptotic Analysis of a Leader Election Algorithm
CoRR abs/cs/0607032: (2006) |
| 22 | | Christian Lavault,
Jean-François Marckert,
Vlady Ravelomanana:
Quasi-Optimal Leader Election Algorithms in Radio Networks with Loglogarithmic Awake Time Slots
CoRR abs/cs/0607034: (2006) |
| 21 | | Christian Lavault:
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
CoRR abs/cs/0611098: (2006) |
| 20 | | Christian Lavault,
Guy Louchard:
Asymptotic analysis of a leader election algorithm.
Theor. Comput. Sci. 359(1-3): 239-254 (2006) |
| 2004 |
|---|
| 19 | | Fayçal Djerourou,
Christian Lavault,
Gabriel Antoine Louis Paillard,
Vlady Ravelomanana:
Assigning Codes in a Random Wireless Network.
ICT 2004: 348-353 |
| 18 | | Christian Lavault:
Embeddings into the Pancake Interconnection Network
CoRR cs.DC/0411095: (2004) |
| 17 | | Marc Bui,
Franck Butelle,
Christian Lavault:
A distributed algorithm for constructing a minimum diameter spanning tree.
J. Parallel Distrib. Comput. 64(5): 571-577 (2004) |
| 2002 |
|---|
| 16 | | Christian Lavault:
Embeddings into the Pancake Interconnection Network.
Parallel Processing Letters 12(3-4): 297-310 (2002) |
| 2001 |
|---|
| 15 | | Colette Johnen,
Ivan Lavallée,
Christian Lavault:
Reliable Self-Stabilizing Communication for Quasi Rendezvous.
Stud. Inform. Univ. 1(1): 59-76 (2001) |
| 2000 |
|---|
| 14 |  | Ivan Lavallée,
Christian Lavault,
Colette Johnen:
Fair and Reliable Self-stabilizing Communication.
OPODIS 2000: 163-176 |
| 1999 |
|---|
| 13 | | Christian Lavault,
Sidi Mohamed Sedjelmaci:
Worst-case analysis of Weber's GCD algorithm.
Inf. Process. Lett. 72(3-4): 125-130 (1999) |
| 1998 |
|---|
| 12 | | Franck Butelle,
Christian Lavault:
Distributed Algorithms for AllPairs Shortest Paths and Minimum Diameter Spanning Tree Problems.
OPODIS 1998: 77-88 |
| 1997 |
|---|
| 11 | | Fouzia Moussouni,
Christian Lavault:
Optimal Pattern Matching on dDimensional Meshes.
OPODIS 1997: 45-60 |
| 10 | | Sidi Mohamed Sedjelmaci,
Christian Lavault:
Improvements on the Accelerated Integer GCD Algorithm.
Inf. Process. Lett. 61(1): 31-36 (1997) |
| 1996 |
|---|
| 9 | | Fouzia Moussouni,
Christian Lavault:
Distributed String Matching Algorithm on the N-cube.
Euro-Par, Vol. I 1996: 832-835 |
| 1995 |
|---|
| 8 | | Fouzia Moussouni,
Christian Lavault:
N-Cube String Matching Algorithm with Long Texts.
Combinatorics and Computer Science 1995: 328-340 |
| 7 | | Franck Butelle,
Christian Lavault,
Marc Bui:
A Uniform Self-Stabilizing Minimum Diameter Tree Algorithm (Extended Abstract).
WDAG 1995: 257-272 |
| 1994 |
|---|
| 6 | | Christian Lavault:
Orientation of Distributed Networks: Graph- and Group- Theoretic Modelling.
SIROCCO 1994: 49-70 |
| 1992 |
|---|
| 5 | | Christian Lavault:
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal).
CONPAR 1992: 133-144 |
| 1990 |
|---|
| 4 | | Ivan Lavallée,
Christian Lavault:
Spanning Tree Construction for Nameless Networks.
WDAG 1990: 41-56 |
| 3 | | Christian Lavault:
Exact Average Message Complexity Values for Distributed Election on Bidirectional Rings of Processors.
Theor. Comput. Sci. 73(1): 61-79 (1990) |
| 1989 |
|---|
| 2 | | Christian Lavault:
Average Number of Messages for Distributed Leader Finding in Rings of Processors.
STACS 1989: 269-281 |
| 1 | | Christian Lavault:
Average Number of Messages for Distributed Leader-Finding in Rings of Processors.
Inf. Process. Lett. 30(4): 167-176 (1989) |
