Computability of Probabilistic Parameters for Some Classes of Formal Languages. - Joffroy Beauquier; Loÿs Thimonier (MFCS, 1984)

On formal languages, probabilities, paging and decoding algorithms. - Joffroy Beauquier; Loÿs Thimonier (FCT, 1985)

Random Allocations and Probabilistic Languages. - Philippe Flajolet; Danièle Gardy; Loÿs Thimonier (ICALP, 1988)

Fonctions Génératrices Transcendantes à Coefficients Engendrés par Automates. - Jean-Paul Allouche; Bernard Rande; Loÿs Thimonier (STACS, 1988)

Using Generating Functions to Compute Concurrency. - Dominique Geniet; Loÿs Thimonier (FCT, 1989)

Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search. - Philippe Flajolet; Danièle Gardy; Loÿs Thimonier (Discret. Appl. Math., 1992)

Random palindromes: multivariate generating function and Bernoulli density. - Philippe Dumas 001; Loÿs Thimonier (Discret. Math., 1995)

A Markovian Concurrency Measure. - Dominique Geniet; René Schott; Loÿs Thimonier (RAIRO Theor. Informatics Appl., 1996)

Some Remarks on Sparsely Connected Isomorphism-Free Labeled Graphs. - Vlady Ravelomanana; Loÿs Thimonier (LATIN, 2000)

Patchworks and metablocks enumeration. - Vlady Ravelomanana; Loÿs Thimonier (Inf. Process. Lett., 2000)

Asymptotic enumeration of cographs. - Vlady Ravelomanana; Loÿs Thimonier (Electron. Notes Discret. Math., 2001)

On the growth of components with non-fixed excesses. - Anne-Elisabeth Baert; Vlady Ravelomanana; Loÿs Thimonier (Discret. Appl. Math., 2003)

Average case analysis-based protocols to initialize packet radio networks. - Jean Frédéric Myoupo; Loÿs Thimonier; Vlady Ravelomanana (Wirel. Commun. Mob. Comput., 2003)

Forbidden subgraphs in connected graphs. - Vlady Ravelomanana; Loÿs Thimonier (Theor. Comput. Sci., 2004)