| 2007 |
|---|
| 18 | EE | Anne-Elisabeth Baert,
Vlady Ravelomanana,
Loÿs Thimonier:
On the growth of components with non fixed excesses
CoRR abs/0706.1642: (2007) |
| 2004 |
|---|
| 17 | EE | Vlady Ravelomanana,
Loÿs Thimonier:
Forbidden Subgraphs in Connected Graphs
CoRR cs.DS/0411093: (2004) |
| 16 | EE | Vlady Ravelomanana,
Loÿs Thimonier:
Forbidden subgraphs in connected graphs.
Theor. Comput. Sci. 314(1-2): 121-171 (2004) |
| 2003 |
|---|
| 15 | EE | Anne-Elisabeth Baert,
Vlady Ravelomanana,
Loÿs Thimonier:
On the growth of components with non-fixed excesses.
Discrete Applied Mathematics 130(3): 487-493 (2003) |
| 14 | EE | Jean Frédéric Myoupo,
Loÿs Thimonier,
Vlady Ravelomanana:
Average case analysis-based protocols to initialize packet radio networks.
Wireless Communications and Mobile Computing 3(4): 539-548 (2003) |
| 2001 |
|---|
| 13 | EE | Anne-Elisabeth Baert,
Vlady Ravelomanana,
Loÿs Thimonier:
On the growth of components with non-fixed excesses.
Electronic Notes in Discrete Mathematics 10: 7-12 (2001) |
| 12 | EE | Vlady Ravelomanana,
Loÿs Thimonier:
Asymptotic enumeration of cographs.
Electronic Notes in Discrete Mathematics 7: 58-61 (2001) |
| 2000 |
|---|
| 11 | | Vlady Ravelomanana,
Loÿs Thimonier:
Some Remarks on Sparsely Connected Isomorphism-Free Labeled Graphs.
LATIN 2000: 28-37 |
| 10 | EE | Vlady Ravelomanana,
Loÿs Thimonier:
Patchworks and metablocks enumeration.
Inf. Process. Lett. 73(3-4): 77-86 (2000) |
| 1996 |
|---|
| 9 | | Dominique Geniet,
René Schott,
Loÿs Thimonier:
A Markovian Concurrency Measure.
ITA 30(4): 295-304 (1996) |
| 1995 |
|---|
| 8 | EE | Philippe Dumas,
Loÿs Thimonier:
Random palindromes: multivariate generating function and Bernoulli density.
Discrete Mathematics 139(1-3): 143-154 (1995) |
| 1992 |
|---|
| 7 | EE | Philippe Flajolet,
Danièle Gardy,
Loÿs Thimonier:
Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search.
Discrete Applied Mathematics 39(3): 207-229 (1992) |
| 1990 |
|---|
| 6 | | Dominique Geniet,
René Schott,
Loÿs Thimonier:
A Markovian Concurrency Measure.
CAAP 1990: 177-190 |
| 1989 |
|---|
| 5 | | Dominique Geniet,
Loÿs Thimonier:
Using Generating Functions to Compute Concurrency.
FCT 1989: 185-196 |
| 1988 |
|---|
| 4 | | Philippe Flajolet,
Danièle Gardy,
Loÿs Thimonier:
Random Allocations and Probabilistic Languages.
ICALP 1988: 239-253 |
| 3 | | Jean-Paul Allouche,
Bernard Rande,
Loÿs Thimonier:
Fonctions Génératrices Transcendantes à Coefficients Engendrés par Automates.
STACS 1988: 170-183 |
| 1985 |
|---|
| 2 | | Joffroy Beauquier,
Loÿs Thimonier:
On formal languages, probabilities, paging and decoding algorithms.
FCT 1985: 44-52 |
| 1984 |
|---|
| 1 | | Joffroy Beauquier,
Loÿs Thimonier:
Computability of Probabilistic Parameters for Some Classes of Formal Languages.
MFCS 1984: 194-204 |
