| Publication | Date of Publication | Type |
|---|
| Back-to-front online Lyndon forest construction | 2024-05-06 | Paper |
| More characterizations of morphic words | 2023-12-17 | Paper |
Maximal closed substrings
String Processing and Information Retrieval | 2023-08-04 | Paper |
| scientific article; zbMATH DE number 7695992 (Why is no real title available?) | 2023-06-14 | Paper |
| Computing the Antiperiod(s) of a String | 2022-07-18 | Paper |
Avoiding square-free words on free groups
Theoretical Computer Science | 2022-06-13 | Paper |
Internal shortest absent word queries in constant time and linear space
Theoretical Computer Science | 2022-06-13 | Paper |
Linear construction of a left Lyndon tree
Information and Computation | 2022-06-08 | Paper |
Constructing antidictionaries of long texts in output-sensitive space
Theory of Computing Systems | 2021-08-05 | Paper |
Avoiding Square-Free Words on Free Groups
(available as arXiv preprint) | 2021-04-14 | Paper |
On suffix tree breadth
String Processing and Information Retrieval | 2021-02-16 | Paper |
On two LZ78-style grammars: compression bounds and compressed-space computation
String Processing and Information Retrieval | 2021-02-16 | Paper |
On two LZ78-style grammars: compression bounds and compressed-space computation
String Processing and Information Retrieval | 2021-02-16 | Paper |
Tight upper and lower bounds on suffix tree breadth
Theoretical Computer Science | 2021-01-25 | Paper |
Avoiding conjugacy classes on the 5-letter alphabet
RAIRO - Theoretical Informatics and Applications | 2020-07-21 | Paper |
| Longest common abelian factors and large alphabets | 2018-10-17 | 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 |
Text redundancies
Combinatorics, Words and Symbolic Dynamics | 2017-10-06 | Paper |
Black-box Complexity of Parallel Search with Distributed Populations
Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII | 2017-05-10 | Paper |
Efficient computation of maximal anti-exponent in palindrome-free strings
Theoretical Computer Science | 2017-02-06 | Paper |
Counting maximal-exponent factors in words
Theoretical Computer Science | 2016-12-19 | Paper |
Closed factorization
Discrete Applied Mathematics | 2016-09-12 | Paper |
Toward a unifying framework for evolutionary processes
Journal of Theoretical Biology | 2016-08-18 | Paper |
On the number of closed factors in a word
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Finite-repetition threshold for infinite ternary words
Electronic Proceedings in Theoretical Computer Science | 2016-03-01 | Paper |
Finite-repetition threshold for infinite ternary words
Electronic Proceedings in Theoretical Computer Science | 2016-03-01 | Paper |
Computing maximal-exponent factors in an overlap-free word
Journal of Computer and System Sciences | 2015-12-30 | Paper |
Characterization of some binary words with few squares
Theoretical Computer Science | 2015-06-11 | Paper |
Infinite binary words containing repetitions of odd period
Information Processing Letters | 2015-04-02 | Paper |
Finite repetition threshold for large alphabets
RAIRO - Theoretical Informatics and Applications | 2014-12-12 | Paper |
Infinite words containing the minimal number of repetitions
Journal of Discrete Algorithms | 2014-08-13 | Paper |
Binary jumbled string matching for highly run-length compressible texts
Information Processing Letters | 2014-04-11 | Paper |
Fewest repetitions in infinite binary words
RAIRO. Theoretical Informatics and Applications | 2012-08-31 | Paper |
Fewest repetitions in infinite binary words
RAIRO. Theoretical Informatics and Applications | 2012-08-31 | Paper |
Fewest repetitions versus maximal-exponent powers in infinite binary words
Theoretical Computer Science | 2011-12-07 | Paper |
Hunting redundancies in strings
Developments in Language Theory | 2011-07-29 | Paper |
