| Publication | Date of Publication | Type |
|---|
Some Results on Digital Segments and Balanced Words
(available as arXiv preprint) | N/A | Paper |
| Generalized de Bruijn words, invertible necklaces, and the Burrows-Wheeler transform | 2026-08-05 | Paper |
| Morphisms and BWT-run sensitivity | 2026-08-05 | Paper |
| On palindromic periodicities | 2026-07-17 | Paper |
Finding maximal closed substrings
Theoretical Computer Science | 2025-12-15 | Paper |
| Digital convexity and combinatorics on words | 2025-11-14 | Paper |
| Substring complexity in sublinear space | 2025-07-24 | Paper |
Some results on digital segments and balanced words
Theoretical Computer Science | 2024-11-18 | Paper |
| On the impact of morphisms on BWT-runs | 2024-10-21 | Paper |
| Minimal absent words in rooted and unrooted trees | 2024-04-19 | Paper |
Maximal closed substrings
String Processing and Information Retrieval | 2023-08-04 | Paper |
Abelian combinatorics on words: a survey
Computer Science Review | 2023-06-20 | Paper |
On the Lie complexity of Sturmian words
Theoretical Computer Science | 2022-10-24 | Paper |
Reverse-safe text indexing
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
Properties of a class of Toeplitz words
Theoretical Computer Science | 2022-06-13 | Paper |
On the Lie complexity of Sturmian words
(available as arXiv preprint) | 2022-06-02 | Paper |
Adaptive learning of compressible strings
Theoretical Computer Science | 2021-11-18 | Paper |
Constructing antidictionaries of long texts in output-sensitive space
Theory of Computing Systems | 2021-08-05 | Paper |
Topological properties of cellular automata on trees
(available as arXiv preprint) | 2021-04-27 | Paper |
| Topological properties of cellular automata on trees | 2021-04-27 | Paper |
Primitive sets of words
Theoretical Computer Science | 2021-04-14 | Paper |
Reverse-safe data structures for text indexing
2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
Theoretical Computer Science | 2020-10-12 | Paper |
| scientific article; zbMATH DE number 7150616 (Why is no real title available?) | 2020-01-13 | Paper |
On sets of words of rank two
(available as arXiv preprint) | 2019-11-06 | Paper |
Minimal forbidden factors of circular words
Theoretical Computer Science | 2019-10-07 | Paper |
Abelian antipowers in infinite words
Advances in Applied Mathematics | 2019-07-11 | Paper |
| Open and closed words | 2019-07-03 | Paper |
Alignment-free sequence comparison using absent words
Information and Computation | 2018-09-27 | Paper |
Alignment-free sequence comparison using absent words
Information and Computation | 2018-09-27 | Paper |
Algorithms for anti-powers in strings
Information Processing Letters | 2018-06-15 | Paper |
Algorithms for anti-powers in strings
Information Processing Letters | 2018-06-15 | Paper |
Anti-powers in infinite words
Journal of Combinatorial Theory. Series A | 2018-04-27 | Paper |
Anti-powers in infinite words
Journal of Combinatorial Theory. Series A | 2018-04-27 | Paper |
| Anti-powers in infinite words | 2017-12-19 | Paper |
Minimal forbidden factors of circular words
Lecture Notes in Computer Science | 2017-11-15 | Paper |
The sequence of open and closed prefixes of a Sturmian word
Advances in Applied Mathematics | 2017-07-13 | Paper |
Abelian-square-rich words
Theoretical Computer Science | 2017-06-15 | Paper |
Cyclic complexity of words
Journal of Combinatorial Theory. Series A | 2017-02-09 | Paper |
Fast computation of abelian runs
Theoretical Computer Science | 2017-02-06 | Paper |
On prefix normal words and prefix normal forms
Theoretical Computer Science | 2016-12-23 | Paper |
A note on easy and efficient computation of full abelian periods of a word
Discrete Applied Mathematics | 2016-09-12 | Paper |
Abelian powers and repetitions in Sturmian words
Theoretical Computer Science | 2016-05-26 | Paper |
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
On the number of closed factors in a word
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Online computation of abelian runs
Language and Automata Theory and Applications | 2016-04-08 | Paper |
A classification of trapezoidal words
Electronic Proceedings in Theoretical Computer Science | 2016-03-01 | Paper |
A classification of trapezoidal words
Electronic Proceedings in Theoretical Computer Science | 2016-03-01 | Paper |
On the greedy algorithm for the shortest common superstring problem with reversals
Information Processing Letters | 2016-01-05 | Paper |
Words with the maximum number of abelian squares
Lecture Notes in Computer Science | 2015-11-04 | Paper |
Algorithms for computing abelian periods of words
Discrete Applied Mathematics | 2015-09-22 | Paper |
Factorizations of the Fibonacci infinite word
(available as arXiv preprint) | 2015-08-18 | Paper |
| Factorizations of the Fibonacci infinite word | 2015-08-18 | Paper |
Vertical representation of \(\mathbf{C}^\infty\)-words
Theoretical Computer Science | 2014-12-22 | Paper |
Universal Lyndon words
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Cyclic Complexity of Words
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
A subquadratic algorithm for minimum palindromic factorization
Journal of Discrete Algorithms | 2014-09-05 | Paper |
On combinatorial generation of prefix normal words
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Binary jumbled string matching for highly run-length compressible texts
Information Processing Letters | 2014-04-11 | Paper |
On the structure of bispecial Sturmian words
Journal of Computer and System Sciences | 2014-02-13 | Paper |
On the least number of palindromes contained in an infinite word
Theoretical Computer Science | 2013-11-29 | Paper |
Open and Closed Prefixes of Sturmian Words
Lecture Notes in Computer Science | 2013-09-20 | Paper |
Abelian repetitions in Sturmian words
Developments in Language Theory | 2013-06-28 | Paper |
Enumeration and structure of trapezoidal words
Theoretical Computer Science | 2013-02-19 | Paper |
On approximate jumbled pattern matching in strings
Theory of Computing Systems | 2012-12-06 | Paper |
A Characterization of Bispecial Sturmian Words
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Algorithms for jumbled pattern matching in strings
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
Automata and differentiable words
Theoretical Computer Science | 2012-08-10 | Paper |
On prefix normal words
Developments in Language Theory | 2011-07-29 | Paper |
Special factors and the combinatorics of suffix and factor automata
Theoretical Computer Science | 2011-07-14 | Paper |
On the regularity of circular splicing languages: a survey and new developments
Natural Computing | 2010-09-16 | Paper |
| Some remarks on differentiable sequences and recursivity | 2010-03-30 | Paper |
| Some remarks on differentiable sequences and recursivity | 2010-03-30 | Paper |
A characterization of regular circular languages generated by marked splicing systems
Theoretical Computer Science | 2009-11-06 | Paper |
Combinatorics of Finite Words and Suffix Automata
Algebraic Informatics | 2009-11-05 | Paper |
Presentations of Constrained Systems With Unconstrained Positions
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Marked Systems and Circular Splicing
Fundamentals of Computation Theory | 2008-02-26 | Paper |
Word assembly through minimal forbidden words
Theoretical Computer Science | 2006-09-14 | Paper |
