Loÿs Thimonier

According to our database1, Loÿs Thimonier authored at least 14 papers between 1984 and 2004.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2004
Forbidden subgraphs in connected graphs.
Theor. Comput. Sci., 2004

2003
Average case analysis-based protocols to initialize packet radio networks.
Wirel. Commun. Mob. Comput., 2003

2001
Asymptotic enumeration of cographs.
Electron. Notes Discret. Math., 2001

On the growth of components with non-fixed excesses.
Electron. Notes Discret. Math., 2001

2000
Patchworks and metablocks enumeration.
Inf. Process. Lett., 2000

Some Remarks on Sparsely Connected Isomorphism-Free Labeled Graphs.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1996
A Markovian Concurrency Measure.
RAIRO Theor. Informatics Appl., 1996

1995
Random palindromes: multivariate generating function and Bernoulli density.
Discret. Math., 1995

1992
Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search.
Discret. Appl. Math., 1992

1989
Using Generating Functions to Compute Concurrency.
Proceedings of the Fundamentals of Computation Theory, 1989

1988
Fonctions Génératrices Transcendantes à Coefficients Engendrés par Automates.
Proceedings of the STACS 88, 1988

Random Allocations and Probabilistic Languages.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1985
On formal languages, probabilities, paging and decoding algorithms.
Proceedings of the Fundamentals of Computation Theory, 1985

1984
Computability of Probabilistic Parameters for Some Classes of Formal Languages.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984


  Loading...