default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Lavault
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2015
[j14]Silvia Goodenough, Christian Lavault:
Overview on Heisenberg - Weyl Algebra and Subsets of Riordan Subgroups. Electron. J. Comb. 22(4): 4 (2015)- 2011
- [j13]Ferruccio Barsi, Alan A. Bertossi, Christian Lavault, Alfredo Navarra
, Stephan Olariu, Maria Cristina Pinotti, Vlady Ravelomanana:
Efficient Location Training Protocols for Heterogeneous Sensor and Actor Networks. IEEE Trans. Mob. Comput. 10(3): 377-391 (2011) - 2008
- [j12]Svante Janson, Christian Lavault, Guy Louchard:
Convergence of Some Leader Election Algorithms. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - [j11]Christian Lavault, Mario Valencia-Pabon:
A distributed approximation algorithm for the minimum degree minimum weight spanning trees. J. Parallel Distributed Comput. 68(2): 200-208 (2008) - 2007
- [j10]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
- [j9]Christian Lavault, Guy Louchard:
Asymptotic analysis of a leader election algorithm. Theor. Comput. Sci. 359(1-3): 239-254 (2006) - 2004
- [j8]Marc Bui, Franck Butelle, Christian Lavault:
A distributed algorithm for constructing a minimum diameter spanning tree. J. Parallel Distributed Comput. 64(5): 571-577 (2004) - 2002
- [j7]Christian Lavault:
Embeddings into the Pancake Interconnection Network. Parallel Process. Lett. 12(3-4): 297-310 (2002) - 2001
- [j6]Colette Johnen, Ivan Lavallée, Christian Lavault:
Reliable Self-Stabilizing Communication for Quasi Rendezvous. Stud. Inform. Univ. 1(1): 59-76 (2001) - 1999
- [j5]Christian Lavault, Sidi Mohamed Sedjelmaci:
Worst-case analysis of Weber's GCD algorithm. Inf. Process. Lett. 72(3-4): 125-130 (1999) - [j4]Alain Bui, Marc Bui, Christian Lavault:
On the hierarchy of functioning rules in distributed computing. RAIRO Oper. Res. 33(1): 15-27 (1999) - 1997
- [j3]Sidi Mohamed Sedjelmaci, Christian Lavault:
Improvements on the Accelerated Integer GCD Algorithm. Inf. Process. Lett. 61(1): 31-36 (1997) - 1990
- [j2]Christian Lavault:
Exact Average Message Complexity Values for Distributed Election on Bidirectional Rings of Processors. Theor. Comput. Sci. 73(1): 61-79 (1990) - 1989
- [j1]Christian Lavault:
Average Number of Messages for Distributed Leader-Finding in Rings of Processors. Inf. Process. Lett. 30(4): 167-176 (1989)
Conference and Workshop Papers
- 2019
- [c15]Gabriel Paillard, Felipe M. G. França, Christian Lavault:
A Distributed Wheel Sieve Algorithm. IPDPS Workshops 2019: 619-626 - 2008
- [c14]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 - 2006
- [c13]Binh Thanh Doan, Christian Lavault, Stephan Olariu, Vlady Ravelomanana:
An energy-efficient initialization algorithm for random radio networks. RIVF 2006: 126-132 - 2005
- [c12]Gabriel Paillard, Christian Antoine Louis Lavault, Felipe Maia Galvão França:
A Distributed Prime Sieving Algorithm based on Scheduling by Multiple Edge Reversal. ISPDC 2005: 139-146 - 2004
- [c11]Fayçal Djerourou, Christian Lavault, Gabriel Antoine Louis Paillard, Vlady Ravelomanana:
Assigning Codes in a Random Wireless Network. ICT 2004: 348-353 - 2000
- [c10]Ivan Lavallée, Christian Lavault, Colette Johnen:
Fair and Reliable Self-stabilizing Communication. OPODIS 2000: 163-176 - 1998
- [c9]Franck Butelle, Christian Lavault:
Distributed Algorithms for AllPairs Shortest Paths and Minimum Diameter Spanning Tree Problems. OPODIS 1998: 77-88 - 1997
- [c8]Fouzia Moussouni, Christian Lavault:
Optimal Pattern Matching on dDimensional Meshes. OPODIS 1997: 45-60 - 1996
- [c7]Fouzia Moussouni, Christian Lavault:
Distributed String Matching Algorithm on the N-cube. Euro-Par, Vol. I 1996: 832-835 - 1995
- [c6]Fouzia Moussouni, Christian Lavault:
N-Cube String Matching Algorithm with Long Texts. Combinatorics and Computer Science 1995: 328-340 - [c5]Franck Butelle, Christian Lavault, Marc Bui:
A Uniform Self-Stabilizing Minimum Diameter Tree Algorithm (Extended Abstract). WDAG 1995: 257-272 - 1994
- [c4]Christian Lavault:
Orientation of Distributed Networks: Graph- and Group- Theoretic Modelling. SIROCCO 1994: 49-70 - 1992
- [c3]Christian Lavault:
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal). CONPAR 1992: 133-144 - 1990
- [c2]Ivan Lavallée, Christian Lavault:
Spanning Tree Construction for Nameless Networks. WDAG 1990: 41-56 - 1989
- [c1]Christian Lavault:
Average Number of Messages for Distributed Leader Finding in Rings of Processors. STACS 1989: 269-281
Informal and Other Publications
- 2014
- [i17]Sidi Mohamed Sedjelmaci, Christian Lavault:
Improvements on the accelerated integer GCD algorithm. CoRR abs/1402.2266 (2014) - [i16]Silvia Goodenough, Christian Lavault:
On subsets of Riordan subgroups and Heisenberg-Weyl algebra. CoRR abs/1404.1894 (2014) - 2013
- [i15]Christian Lavault:
Multiplicate inverse forms of terminating hypergeometric series. CoRR abs/1311.4502 (2013) - [i14]Christian Lavault, Sidi Mohamed Sedjelmaci:
Worst-Case Analysis of Weber's Algorithm. CoRR abs/1311.7369 (2013) - [i13]Marc Bui, Franck Butelle, Christian Lavault:
A Distributed Algorithm for Constructing a Minimum Diameter Spanning Tree. CoRR abs/1312.1961 (2013) - [i12]Sidi Mohamed Sedjelmaci, Christian Lavault:
A New Modular Division Algorithm and Applications. CoRR abs/1312.2570 (2013) - [i11]Franck Butelle, Christian Lavault, Marc Bui:
A Uniform Self-Stabilizing Minimum Diameter Spanning Tree Algorithm. CoRR abs/1312.3303 (2013) - [i10]Gabriel Paillard, Christian Lavault, Felipe Maia Galvão França:
A distributed prime sieving algorithm based on Scheduling by Multiple Edge Reversal. CoRR abs/1312.4508 (2013) - 2011
- [i9]Christian Lavault:
A note on Prüfer-like coding and counting forests of uniform hypertrees. CoRR abs/1110.0204 (2011) - 2010
- [i8]Colette Johnen, Ivan Lavallée, Christian Lavault:
Reliable Self-Stabilizing Communication for Quasi Rendezvous. CoRR abs/1005.5630 (2010) - 2008
- [i7]Svante Janson, Christian Lavault, Guy Louchard:
Convergence of some leader election algorithms. CoRR abs/0802.1389 (2008) - 2006
- [i6]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) - [i5]Christian Lavault, Mario Valencia-Pabon:
A distributed approximation algorithm for the minimum degree minimum weight spanning trees. CoRR abs/cs/0607031 (2006) - [i4]Christian Lavault, Guy Louchard:
Asymptotic Analysis of a Leader Election Algorithm. CoRR abs/cs/0607032 (2006) - [i3]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) - [i2]Christian Lavault:
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal). CoRR abs/cs/0611098 (2006) - 2004
- [i1]Christian Lavault:
Embeddings into the Pancake Interconnection Network. CoRR cs.DC/0411095 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
