Christian Lavault

According to our database1, Christian Lavault authored at least 28 papers between 1989 and 2015.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2015
Overview on Heisenberg - Weyl Algebra and Subsets of Riordan Subgroups.
Electr. J. Comb., 2015

2011
Efficient Location Training Protocols for Heterogeneous Sensor and Actor Networks.
IEEE Trans. Mob. Comput., 2011

2008
A distributed approximation algorithm for the minimum degree minimum weight spanning trees.
J. Parallel Distrib. Comput., 2008

Convergence of Some Leader Election Algorithms.
Discrete Mathematics & Theoretical Computer Science, 2008

Efficient binary schemes for training heterogeneous sensor and actor networks.
Proceedings of the 1st ACM International Workshop on Heterogeneous Sensor and Actor Networks, 2008

2007
Quasi-optimal energy-efficient leader election algorithms in radio networks.
Inf. Comput., 2007

2006
Asymptotic analysis of a leader election algorithm.
Theor. Comput. Sci., 2006

An energy-efficient initialization algorithm for random radio networks.
Proceedings of the 4th International Confernce on Computer Sciences: Research, 2006

2005
A Distributed Prime Sieving Algorithm based on Scheduling by Multiple Edge Reversal.
Proceedings of the 4th International Symposium on Parallel and Distributed Computing (ISPDC 2005), 2005

2004
A distributed algorithm for constructing a minimum diameter spanning tree.
J. Parallel Distrib. Comput., 2004

Assigning Codes in a Random Wireless Network.
Proceedings of the Telecommunications and Networking, 2004

2002
Embeddings into the Pancake Interconnection Network.
Parallel Processing Letters, 2002

2001
Reliable Self-Stabilizing Communication for Quasi Rendezvous.
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
On the hierarchy of functioning rules in distributed computing.
RAIRO - Operations Research, 1999

Worst-case analysis of Weber's GCD algorithm.
Inf. Process. Lett., 1999

1998
Distributed Algorithms for AllPairs Shortest Paths and Minimum Diameter Spanning Tree Problems.
Proceedings of the Distributed Computing, 1998

1997
Improvements on the Accelerated Integer GCD Algorithm.
Inf. Process. Lett., 1997

Optimal Pattern Matching on dDimensional Meshes.
Proceedings of the On Principles Of Distributed Systems, 1997

1996
Distributed String Matching Algorithm on the N-cube.
Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995
A Uniform Self-Stabilizing Minimum Diameter Tree Algorithm (Extended Abstract).
Proceedings of the Distributed Algorithms, 9th International Workshop, 1995

N-Cube String Matching Algorithm with Long Texts.
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

Spanning Tree Construction for Nameless Networks.
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

1989
Average Number of Messages for Distributed Leader-Finding in Rings of Processors.
Inf. Process. Lett., 1989

Average Number of Messages for Distributed Leader Finding in Rings of Processors.
Proceedings of the STACS 89, 1989


  Loading...