Christian Lavault

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◁ ▶ single authored publications

> Home > Persons > Christian Lavault

Publications

2013
[i15]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/Lavault13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/Lavault13
Christian Lavault:
Multiplicate inverse forms of terminating hypergeometric series. CoRR abs/1311.4502 (2013)
2011
[i9]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1110-0204
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1110-0204
Christian Lavault:
A note on Prüfer-like coding and counting forests of uniform hypertrees. CoRR abs/1110.0204 (2011)
2006
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-cs-0611098
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-cs-0611098
Christian Lavault:
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal). CoRR abs/cs/0611098 (2006)
2004
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/cs-DC-0411095
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/cs-DC-0411095
Christian Lavault:
Embeddings into the Pancake Interconnection Network. CoRR cs.DC/0411095 (2004)
2002
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/ppl/Lavault02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ppl/Lavault02
Christian Lavault:
Embeddings into the Pancake Interconnection Network. Parallel Process. Lett. 12(3-4): 297-310 (2002)
1994
[c4]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/sirocco/Lavault94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sirocco/Lavault94
Christian Lavault:
Orientation of Distributed Networks: Graph- and Group- Theoretic Modelling. SIROCCO 1994: 49-70
1992
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/conpar/Lavault92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/conpar/Lavault92
Christian Lavault:
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal). CONPAR 1992: 133-144
1990
[j2]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/Lavault90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Lavault90
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]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/Lavault89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Lavault89
Christian Lavault:
Average Number of Messages for Distributed Leader-Finding in Rings of Processors. Inf. Process. Lett. 30(4): 167-176 (1989)
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/stacs/Lavault89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/Lavault89
Christian Lavault:
Average Number of Messages for Distributed Leader Finding in Rings of Processors. STACS 1989: 269-281

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.