default search action
Loÿs Thimonier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
- [i2]Anne-Elisabeth Baert, Vlady Ravelomanana, Loÿs Thimonier:
On the growth of components with non fixed excesses. CoRR abs/0706.1642 (2007) - 2004
- [j9]Vlady Ravelomanana, Loÿs Thimonier:
Forbidden subgraphs in connected graphs. Theor. Comput. Sci. 314(1-2): 121-171 (2004) - [i1]Vlady Ravelomanana, Loÿs Thimonier:
Forbidden Subgraphs in Connected Graphs. CoRR cs.DS/0411093 (2004) - 2003
- [j8]Anne-Elisabeth Baert, Vlady Ravelomanana, Loÿs Thimonier:
On the growth of components with non-fixed excesses. Discret. Appl. Math. 130(3): 487-493 (2003) - [j7]Jean Frédéric Myoupo
, Loÿs Thimonier, Vlady Ravelomanana:
Average case analysis-based protocols to initialize packet radio networks. Wirel. Commun. Mob. Comput. 3(4): 539-548 (2003) - 2001
- [j6]Vlady Ravelomanana, Loÿs Thimonier:
Asymptotic enumeration of cographs. Electron. Notes Discret. Math. 7: 58-61 (2001) - [j5]Anne-Elisabeth Baert, Vlady Ravelomanana, Loÿs Thimonier:
On the growth of components with non-fixed excesses. Electron. Notes Discret. Math. 10: 7-12 (2001) - 2000
- [j4]Vlady Ravelomanana, Loÿs Thimonier:
Patchworks and metablocks enumeration. Inf. Process. Lett. 73(3-4): 77-86 (2000) - [c7]Vlady Ravelomanana, Loÿs Thimonier:
Some Remarks on Sparsely Connected Isomorphism-Free Labeled Graphs. LATIN 2000: 28-37
1990 – 1999
- 1996
- [j3]Dominique Geniet, René Schott, Loÿs Thimonier:
A Markovian Concurrency Measure. RAIRO Theor. Informatics Appl. 30(4): 295-304 (1996) - 1995
- [j2]Philippe Dumas, Loÿs Thimonier:
Random palindromes: multivariate generating function and Bernoulli density. Discret. Math. 139(1-3): 143-154 (1995) - 1992
- [j1]Philippe Flajolet, Danièle Gardy
Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search. Discret. Appl. Math. 39(3): 207-229 (1992) - 1990
- [c6]Dominique Geniet, René Schott, Loÿs Thimonier:
A Markovian Concurrency Measure. CAAP 1990: 177-190
1980 – 1989
- 1989
- [c5]Dominique Geniet, Loÿs Thimonier:
Using Generating Functions to Compute Concurrency. FCT 1989: 185-196 - 1988
- [c4]Philippe Flajolet, Danièle Gardy, Loÿs Thimonier:
Random Allocations and Probabilistic Languages. ICALP 1988: 239-253 - [c3]Jean-Paul Allouche
Fonctions Génératrices Transcendantes à Coefficients Engendrés par Automates. STACS 1988: 170-183 - 1985
- [c2]Joffroy Beauquier, Loÿs Thimonier:
On formal languages, probabilities, paging and decoding algorithms. FCT 1985: 44-52 - 1984
- [c1]Joffroy Beauquier, Loÿs Thimonier:
Computability of Probabilistic Parameters for Some Classes of Formal Languages. MFCS 1984: 194-204
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: