default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDamien Jamet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Chloé Boisson, Damien Jamet, Irène Marcovici:
On a probabilistic extension of the Oldenburger-Kolakoski sequence. RAIRO Theor. Informatics Appl. 58: 11 (2024)- [c8]Shigeki Akiyama, Damien Jamet, Irène Marcovici, Mai-Linh Trân-Công:
Self-descriptive Sequences directed by two Periodic Sequences. GASCom 2024: 18-22 - 2023
- [j12]Karam Aloui, Damien Jamet, Hajime Kaneko, Steffen Kopecki, Pierre Popoli
, Thomas Stoll:
On the binary digits of n and n2. Theor. Comput. Sci. 939: 119-139 (2023) - [i3]Chloé Boisson, Damien Jamet, Irène Marcovici:
On a probabilistic extension of the Oldenburger-Kolakoski sequence. CoRR abs/2301.01116 (2023) - 2021
- [j11]Damien Jamet, Pierre Popoli, Thomas Stoll:
Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences. Cryptogr. Commun. 13(5): 791-814 (2021)
2010 – 2019
- 2016
- [j10]Damien Jamet:
Foreword - Special issue dedicated to the fifteenth "Journées Montoises d'Informatique Théorique". RAIRO Theor. Informatics Appl. 50(1): 1 (2016) - [c7]Damien Jamet, Nadia Lafrenière, Xavier Provençal:
Generation of Digital Planes Using Generalized Continued-Fractions Algorithms. DGCI 2016: 45-56 - 2014
- [j9]Anna E. Frid, Damien Jamet:
The number of binary rotation words. RAIRO Theor. Informatics Appl. 48(4): 453-465 (2014) - 2013
- [c6]Valérie Berthé, Damien Jamet, Timo Jolivet, Xavier Provençal:
Critical Connectedness of Thin Arithmetical Discrete Planes. DGCI 2013: 107-118 - [i2]Anna E. Frid, Damien Jamet:
The number of binary rotation words. CoRR abs/1302.3722 (2013) - [i1]Valérie Berthé, Damien Jamet, Timo Jolivet, Xavier Provençal:
Critical connectedness of thin arithmetical discrete planes. CoRR abs/1312.7820 (2013) - 2012
- [j8]Eric Domenjoud, Damien Jamet, Damien Vergnaud, Laurent Vuillon:
Enumeration formula for (2, n)-cubes in discrete planes. Discret. Appl. Math. 160(15): 2158-2171 (2012) - 2011
- [j7]Damien Jamet, Geneviève Paquin, Gwénaël Richomme, Laurent Vuillon:
On the fixed points of the iterated pseudopalindromic closure operator. Theor. Comput. Sci. 412(27): 2974-2987 (2011) - 2010
- [j6]Nicolas Bedaride, Eric Domenjoud, Damien Jamet, Jean-Luc Rémy:
On the number of balanced words of given length and height over a two letter alphabet. Discret. Math. Theor. Comput. Sci. 12(3): 41-62 (2010)
2000 – 2009
- 2009
- [j5]Damien Jamet, Jean-Luc Toutant:
Minimal arithmetic thickness connecting discrete planes. Discret. Appl. Math. 157(3): 500-509 (2009) - [c5]Eric Domenjoud, Damien Jamet, Jean-Luc Toutant:
On the Connecting Thickness of Arithmetical Discrete Planes. DGCI 2009: 362-372 - 2008
- [j4]Srecko Brlek, Damien Jamet, Geneviève Paquin:
Smooth words on 2-letter alphabets having same parity. Theor. Comput. Sci. 393(1-3): 166-181 (2008) - 2007
- [j3]Olivier Bodini, Damien Jamet:
Tiling a Pyramidal Polycube with Dominoes. Discret. Math. Theor. Comput. Sci. 9(2) (2007) - [j2]Valérie Berthé, Christophe Fiorio, Damien Jamet, Fabrice Philippe:
On some applications of generalized functionality for arithmetic discrete planes. Image Vis. Comput. 25(10): 1671-1684 (2007) - [j1]Pierre Arnoux, Valérie Berthé, Thomas Fernique, Damien Jamet:
Functional stepped surfaces, flips, and generalized substitutions. Theor. Comput. Sci. 380(3): 251-265 (2007) - 2006
- [c4]Damien Jamet, Jean-Luc Toutant:
On the Connectedness of Rational Arithmetic Discrete Hyperplanes. DGCI 2006: 223-234 - [c3]Isabelle Debled-Rennesson, Eric Domenjoud, Damien Jamet:
Arithmetic Discrete Parabolas. ISVC (2) 2006: 480-489 - 2005
- [c2]Valérie Berthé, Christophe Fiorio, Damien Jamet:
Generalized Functionality for Arithmetic Discrete Planes. DGCI 2005: 276-286 - 2004
- [c1]Damien Jamet:
On the Language of Standard Discrete Planes and Surfaces. IWCIA 2004: 232-247
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-09-05 23:43 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:
