default search action
Sébastien Labbé 0001
Person information
- affiliation: Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux, Bordeaux, France
Other persons with the same name
- Sébastien Labbé 0002
— EDF R&D, Chatou, France
- Sébastien Labbé 0003 — École normale supérieure
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c10]Tristan Roussillon
Decomposition of Rational Discrete Planes. DGMM 2024: 54-66 - 2023
- [j16]Sébastien Labbé
A Fibonacci analogue of the two's complement numeration system. RAIRO Theor. Informatics Appl. 57: 12 (2023) - 2022
- [j15]Sébastien Labbé, Mélodie Lapointe:
The $q$-analog of the Markoff injectivity conjecture over the language of a balanced sequence. Comb. Theory 2(1) (2022) - [i9]Sébastien Labbé, Jana Lepsová:
A Fibonacci's complement numeration system. CoRR abs/2205.02574 (2022) - 2021
- [j14]Sébastien Labbé
Substitutive Structure of Jeandel-Rao Aperiodic Tilings. Discret. Comput. Geom. 65(3): 800-855 (2021) - [j13]Sebastián Barbieri
A characterization of Sturmian sequences by indistinguishable asymptotic pairs. Eur. J. Comb. 95: 103318 (2021) - [c9]Sébastien Labbé
A Numeration System for Fibonacci-Like Wang Shifts. WORDS 2021: 104-116 - [i8]Sébastien Labbé
A numeration system for Fibonacci-like Wang shifts. CoRR abs/2105.11898 (2021)
2010 – 2019
- 2018
- [i7]Sébastien Labbé
Substitutive structure of Jeandel-Rao aperiodic tilings. CoRR abs/1808.07768 (2018) - 2017
- [j12]Sébastien Labbé
On the Zero Defect Conjecture. Eur. J. Comb. 62: 132-146 (2017) - [c8]Julien Cassaigne, Sébastien Labbé
A Set of Sequences of Complexity 2n+1 2 n + 1. WORDS 2017: 144-156 - [c7]Niccolò Castronuovo
A Permutation on Words in a Two Letter Alphabet. WORDS 2017: 240-251 - 2016
- [j11]Sébastien Labbé
Palindromic sequences generated from marked morphisms. Eur. J. Comb. 51: 200-214 (2016) - [c6]Sébastien Labbé
Bispecial Factors in the Brun S-Adic System. DLT 2016: 280-292 - [i6]Sébastien Labbé, Edita Pelantová, Stepán Starosta:
On the Zero Defect Conjecture. CoRR abs/1606.05525 (2016) - 2015
- [j10]Valérie Berthé, Sébastien Labbé
Factor complexity of S-adic words generated by the Arnoux-Rauzy-Poincaré algorithm. Adv. Appl. Math. 63: 90-130 (2015) - [j9]Sébastien Labbé
A d-dimensional Extension of Christoffel Words. Discret. Comput. Geom. 54(1): 152-181 (2015) - [i5]Sébastien Labbé:
3-dimensional Continued Fraction Algorithms Cheat Sheets. CoRR abs/1511.08399 (2015) - 2014
- [j8]Sébastien Labbé
A Counterexample to a Question of Hof, Knill and Simon. Electron. J. Comb. 21(3): 3 (2014) - [i4]Sébastien Labbé, Christophe Reutenauer:
A d-dimensional extension of Christoffel words. CoRR abs/1404.4021 (2014) - [i3]Valérie Berthé, Sébastien Labbé:
Factor Complexity of S-adic sequences generated by the Arnoux-Rauzy-Poincaré Algorithm. CoRR abs/1404.4189 (2014) - 2013
- [j7]Alexandre Blondin Massé, Ariane Garon, Sébastien Labbé
Combinatorial properties of double square tiles. Theor. Comput. Sci. 502: 98-117 (2013) - [c5]Valérie Berthé, Sébastien Labbé:
Convergence and Factor Complexity for the Arnoux-Rauzy-Poincaré Algorithm. WORDS 2013: 71-82 - [i2]Sébastien Labbé
A counterexample to a question of Hof, Knill and Simon. CoRR abs/1307.1589 (2013) - 2012
- [j6]Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé
A parallelogram tile fills the plane by translation in at most two distinct ways. Discret. Appl. Math. 160(7-8): 1011-1018 (2012) - 2011
- [j5]Alexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé
Equations on palindromes and circular words. Theor. Comput. Sci. 412(27): 2922-2930 (2011) - [j4]Alexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé
Two infinite families of polyominoes that tile the plane by translation in two distinct ways. Theor. Comput. Sci. 412(36): 4778-4786 (2011) - [j3]Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé
Palindromic complexity of codings of rotations. Theor. Comput. Sci. 412(46): 6455-6463 (2011) - [c4]Valérie Berthé, Sébastien Labbé
An Arithmetic and Combinatorial Approach to Three-Dimensional Discrete Lines. DGCI 2011: 47-58 - [c3]Valérie Berthé, Sébastien Labbé:
Uniformly balanced words with linear complexity and prescribed letter frequencies. WORDS 2011: 44-52
2000 – 2009
- 2009
- [j2]Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé
Codings of rotations on two intervals are full. Electron. Notes Discret. Math. 34: 289-293 (2009) - [c2]Alexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé
Christoffel and Fibonacci Tiles. DGCI 2009: 67-78 - 2008
- [c1]Alexandre Blondin Massé, Srecko Brlek, Andrea Frosini, Sébastien Labbé
Reconstructing words from a fixed palindromic length sequence. IFIP TCS 2008: 101-114 - 2007
- [j1]Alexandre Blondin Massé, Srecko Brlek, Amy Glen, Sébastien Labbé:
On the Critical Exponent of Generalized Thue-Morse Words. Discret. Math. Theor. Comput. Sci. 9(1) (2007) - [i1]Alexandre Blondin Massé, Srecko Brlek, Amy Glen, Sébastien Labbé:
On the critical exponent of generalized Thue-Morse words. CoRR abs/0710.4031 (2007)
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-11-26 20:47 CET 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: