Sébastien Labbé

Orcid: 0000-0002-7330-2718

Affiliations:
  • Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux, Bordeaux, France


According to our database1, Sébastien Labbé authored at least 28 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Decomposition of Rational Discrete Planes.
Proceedings of the Discrete Geometry and Mathematical Morphology, 2024

2023
A Fibonacci analogue of the two's complement numeration system.
RAIRO Theor. Informatics Appl., 2023

2022
A Fibonacci's complement numeration system.
CoRR, 2022

2021
A characterization of Sturmian sequences by indistinguishable asymptotic pairs.
Eur. J. Comb., 2021

Substitutive Structure of Jeandel-Rao Aperiodic Tilings.
Discret. Comput. Geom., 2021

A Numeration System for Fibonacci-Like Wang Shifts.
Proceedings of the Combinatorics on Words - 13th International Conference, 2021

2017
On the Zero Defect Conjecture.
Eur. J. Comb., 2017

A Permutation on Words in a Two Letter Alphabet.
Proceedings of the Combinatorics on Words - 11th International Conference, 2017

A Set of Sequences of Complexity 2n+1 2 n + 1.
Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2016
Palindromic sequences generated from marked morphisms.
Eur. J. Comb., 2016

Bispecial Factors in the Brun S-Adic System.
Proceedings of the Developments in Language Theory - 20th International Conference, 2016

2015
A d-dimensional Extension of Christoffel Words.
Discret. Comput. Geom., 2015

3-dimensional Continued Fraction Algorithms Cheat Sheets.
CoRR, 2015

Factor complexity of <i>S</i>-adic words generated by the Arnoux-Rauzy-Poincaré algorithm.
Adv. Appl. Math., 2015

2014
Factor Complexity of S-adic sequences generated by the Arnoux-Rauzy-Poincaré Algorithm.
CoRR, 2014

A Counterexample to a Question of Hof, Knill and Simon.
Electron. J. Comb., 2014

2013
Combinatorial properties of double square tiles.
Theor. Comput. Sci., 2013

Convergence and Factor Complexity for the Arnoux-Rauzy-Poincaré Algorithm.
Proceedings of the Combinatorics on Words - 9th International Conference, 2013

2012
A parallelogram tile fills the plane by translation in at most two distinct ways.
Discret. Appl. Math., 2012

2011
Palindromic complexity of codings of rotations.
Theor. Comput. Sci., 2011

Two infinite families of polyominoes that tile the plane by translation in two distinct ways.
Theor. Comput. Sci., 2011

Equations on palindromes and circular words.
Theor. Comput. Sci., 2011

Uniformly balanced words with linear complexity and prescribed letter frequencies
Proceedings of the Proceedings 8th International Conference Words 2011, 2011

An Arithmetic and Combinatorial Approach to Three-Dimensional Discrete Lines.
Proceedings of the Discrete Geometry for Computer Imagery, 2011

2009
Codings of rotations on two intervals are full.
Electron. Notes Discret. Math., 2009

Christoffel and Fibonacci Tiles.
Proceedings of the Discrete Geometry for Computer Imagery, 2009

2008
Reconstructing words from a fixed palindromic length sequence.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

2007
On the Critical Exponent of Generalized Thue-Morse Words.
Discret. Math. Theor. Comput. Sci., 2007


  Loading...