Loÿs Thimonier - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 16 from 16

2004

Forbidden subgraphs in connected graphsVlady Ravelomanana, Loÿs Thimonier. TCS, 314(1-2):121-171, 2004. [doi]

2003

On the growth of components with non-fixed excessesAnne-Elisabeth Baert, Vlady Ravelomanana, Loÿs Thimonier. DAM, 130(3):487-493, 2003. [doi]

Average case analysis-based protocols to initialize packet radio networksJean Frédéric Myoupo, Loÿs Thimonier, Vlady Ravelomanana. wicomm, 3(4):539-548, 2003. [doi]

2001

On the growth of components with non-fixed excessesAnne-Elisabeth Baert, Vlady Ravelomanana, Loÿs Thimonier. endm, 10:7-12, 2001. [doi]

Asymptotic enumeration of cographsVlady Ravelomanana, Loÿs Thimonier. endm, 7:58-61, 2001. [doi]

2000

Some Remarks on Sparsely Connected Isomorphism-Free Labeled GraphsVlady Ravelomanana, Loÿs Thimonier. latin 2000: 28-37

Patchworks and metablocks enumerationVlady Ravelomanana, Loÿs Thimonier. ipl, 73(3-4):77-86, 2000. [doi]

1996

A Markovian Concurrency MeasureDominique Geniet, René Schott, Loÿs Thimonier. ita, 30(4):295-304, 1996.

1995

Random palindromes: multivariate generating function and Bernoulli densityPhilippe Dumas, Loÿs Thimonier. DM, 139(1-3):143-154, 1995. [doi]

1992

Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing SearchPhilippe Flajolet, Danièle Gardy, Loÿs Thimonier. DAM, 39(3):207-229, 1992. [doi]

1990

A Markovian Concurrency MeasureDominique Geniet, René Schott, Loÿs Thimonier. caap 1990: 177-190

1989

Using Generating Functions to Compute ConcurrencyDominique Geniet, Loÿs Thimonier. fct 1989: 185-196

1988

Fonctions Génératrices Transcendantes à Coefficients Engendrés par AutomatesJean-Paul Allouche, Bernard Rande, Loÿs Thimonier. STACS 1988: 170-183

Random Allocations and Probabilistic LanguagesPhilippe Flajolet, Danièle Gardy, Loÿs Thimonier. icalp 1988: 239-253

1985

On formal languages, probabilities, paging and decoding algorithmsJoffroy Beauquier, Loÿs Thimonier. fct 1985: 44-52

1984

Computability of Probabilistic Parameters for Some Classes of Formal LanguagesJoffroy Beauquier, Loÿs Thimonier. mfcs 1984: 194-204

Sign in or sign up to see more results.

runs on WebDSL