| Publication | Date of Publication | Type |
|---|
On the Number of Distinct Squares in Finite Sequences: Some Old and New Results
Lecture Notes in Computer Science | 2023-07-25 | Paper |
On the number of squares in a finite word
| 2022-04-21 | Paper |
Burrows-Wheeler transform of words defined by morphisms
| 2020-02-25 | Paper |
Combinatorial aspects of Escher tilings
| 2017-11-14 | Paper |
Reconstructing binary matrices with timetabling constraints
Journal of Discrete Algorithms | 2016-12-09 | Paper |
A tomographical interpretation of a sufficient condition on \(h\)-graphical sequences
Discrete Geometry for Computer Imagery | 2016-07-15 | Paper |
Efficient operations on discrete paths
Theoretical Computer Science | 2016-04-01 | Paper |
Interactions between digital geometry and combinatorics on words
Electronic Proceedings in Theoretical Computer Science | 2016-03-01 | Paper |
Palindromic complexity of trees
Developments in Language Theory | 2015-11-10 | Paper |
Reconstructing words from a \(\sigma\)-palindromic language
Fundamenta Informaticae | 2015-06-26 | Paper |
Efficient Computation of the Outer Hull of a Discrete Path
Advanced Information Systems Engineering | 2014-09-15 | Paper |
Exhaustive generation of atomic combinatorial differential operators
Theoretical Computer Science | 2014-05-06 | Paper |
Codings of rotations on two intervals are full
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Complexity of the Fibonacci snowflake
Fractals | 2013-07-03 | Paper |
Fibonacci snowflakes
Annales des Sciences Mathématiques du Québec | 2012-05-30 | Paper |
A parallelogram tile fills the plane by translation in at most two distinct ways
Discrete Applied Mathematics | 2012-05-30 | Paper |
A new characterization of the Fibonacci word
Congressus Numerantium | 2012-05-10 | Paper |
Combinatorial variations on Cantor's diagonal
Journal of Combinatorial Theory. Series A | 2012-02-11 | Paper |
Palindromic complexity of codings of rotations
Theoretical Computer Science | 2011-12-07 | Paper |
A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\)
Theoretical Computer Science | 2011-09-12 | Paper |
Two infinite families of polyominoes that tile the plane by translation in two distinct ways
Theoretical Computer Science | 2011-09-12 | Paper |
Equations on palindromes and circular words
Theoretical Computer Science | 2011-06-16 | Paper |
Combinatorial properties of \(f\)-palindromes in the Thue-Morse sequence
| 2011-02-22 | Paper |
Complexity and palindromic defect of infinite words
Theoretical Computer Science | 2011-02-02 | Paper |
Incremental algorithms based on discrete Green theorem.
Lecture Notes in Computer Science | 2010-01-05 | Paper |
PCIF: an algorithm for lossless true color image compression
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Christoffel and Fibonacci tiles
Discrete Geometry for Computer Imagery | 2009-12-01 | Paper |
A linear time and space algorithm for detecting path intersection
Discrete Geometry for Computer Imagery | 2009-12-01 | Paper |
Lyndon + Christoffel = digitally convex
Pattern Recognition | 2009-08-19 | Paper |
On the tiling by translation problem
Discrete Applied Mathematics | 2009-03-04 | Paper |
Discrete sets with minimal moment of inertia
Theoretical Computer Science | 2008-11-12 | Paper |
On the critical exponent of generalized Thue-Morse words
| 2008-05-27 | Paper |
Properties of the extremal infinite smooth words
| 2008-05-27 | Paper |
Combinatorial View of Digital Convexity
Discrete Geometry for Computer Imagery | 2008-04-24 | Paper |
On Minimal Moment of Inertia Polyominoes
Discrete Geometry for Computer Imagery | 2008-04-24 | Paper |
An Optimal Algorithm for Detecting Pseudo-squares
Discrete Geometry for Computer Imagery | 2008-04-17 | Paper |
Smooth words on 2-letter alphabets having same parity
Theoretical Computer Science | 2008-04-15 | Paper |
Shuffle operations on discrete paths
Theoretical Computer Science | 2008-03-05 | Paper |
PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS
International Journal of Foundations of Computer Science | 2006-08-14 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2006-06-23 | Paper |
Non-uniform random generation of generalized Motzkin paths
Acta Informatica | 2006-05-26 | Paper |
Combinatorial properties of smooth infinite words
Theoretical Computer Science | 2006-03-24 | Paper |
Tilings by translation: enumeration by a rational language approach
The Electronic Journal of Combinatorics | 2006-02-16 | Paper |
The discrete Green theorem and some applications in discrete geometry
Theoretical Computer Science | 2006-01-10 | Paper |
Cantorian tableaux and permanents
L'Enseignement Mathématique. 2e Série | 2005-09-28 | Paper |
Smooth words over arbitrary alphabets
Theoretical Computer Science | 2005-09-22 | Paper |
On the equivalence problem for succession rules
Discrete Mathematics | 2005-09-22 | Paper |
Algorithms for polyominoes based on the discrete Green theorem
Discrete Applied Mathematics | 2005-05-04 | Paper |
scientific article; zbMATH DE number 2152304 (Why is no real title available?)
| 2005-04-04 | Paper |
scientific article; zbMATH DE number 2051180 (Why is no real title available?)
| 2004-03-07 | Paper |
scientific article; zbMATH DE number 1984536 (Why is no real title available?)
| 2003-09-22 | Paper |
A note on differentiable palindromes.
Theoretical Computer Science | 2003-08-17 | Paper |
On a valuation of rational subsets of \(Z^{k}\)
Theoretical Computer Science | 2003-01-22 | Paper |
A relative of the Thue-Morse sequence
Discrete Mathematics | 1996-06-19 | Paper |
On-line evaluation of powers using Euclid's algorithm
RAIRO - Theoretical Informatics and Applications | 1996-02-01 | Paper |
Efficient computation of addition chains
Journal de Théorie des Nombres de Bordeaux | 1995-05-15 | Paper |
Enumeration of factors in the Thue-Morse word
Discrete Applied Mathematics | 1989-01-01 | Paper |
Optimal word chains for the Thue-Morse word
Information and Computation | 1989-01-01 | Paper |
Addition chains using continued fractions
Journal of Algorithms | 1989-01-01 | Paper |
On the length of word chains
Information Processing Letters | 1987-01-01 | Paper |
