Computing the Antiperiod(s) of a String, 30th Annual Symposium on Combinatorial Pattern Matching (CPM). LIPIcs, 2019. ,
Quasi-Linear-Time Algorithm for Longest Common Circular Factor, 30th Annual Symposium on Combinatorial Pattern Matching (CPM). LIPIcs, 2019. ,
Longest property-preserved common factor, 25th International Symposium on String Processing and Information Retrieval (SPIRE), vol.11147, pp.42-49, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01921603
Algorithms for anti-powers in strings, Information Processing Letters, vol.137, pp.57-60, 2018. ,
On finding a longest common palindromic subsequence, Theoretical Computer Science, vol.710, pp.29-34, 2018. ,
Longest common extensions in sublinear space, Combinatorial Pattern Matching, pp.65-76, 2015. ,
(k,?)-anti-powers and other patterns in words, Electronic Journal of Combinatorics, vol.25, 2018. ,
Computing a longest common palindromic subsequence, Fundam. Inf, vol.129, issue.4, pp.329-340, 2014. ,
Repetitions in strings: Algorithms and combinatorics, mathematical Foundations of Computer Science, vol.410, pp.5227-5235, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-00741884
Jewels of stringology, 2002. ,
URL : https://hal.archives-ouvertes.fr/hal-00619795
Anti-power prefixes of the Thue-Morse word, Electronic Journal of Combinatorics, vol.24, 2017. ,
A new universal class of hash functions and dynamic hashing in real time, International Conference on Automata, Languages and Programming, pp.6-19, 1990. ,
Dynamic perfect hashing: Upper and lower bounds, SIAM Journal on Computing, vol.23, issue.4, pp.738-761, 1994. ,
Anti-Powers in Infinite Words, ICALP 2016. Leibniz International Proceedings in Informatics (LIPIcs), vol.55, pp.1-124, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01829146
Anti-powers in infinite words, Journal of Combinatorial Theory, Series A, vol.157, pp.109-119, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01829146
Space-efficient preprocessing schemes for range minimum queries on static arrays, SIAM Journal on Computing, vol.40, issue.2, pp.465-492, 2011. ,
Optimal dynamic strings, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 1509-1528. SODA '18, 2018. ,
A hardness result and new algorithm for the longest common palindromic subsequence problem, Information Processing Letters, vol.129, pp.11-15, 2018. ,
Computing longest common square subsequences, 29th Symposium on Combinatorial Pattern Matching (CPM). LIPIcs, vol.105, pp.1-15, 2018. ,
Efficient randomized pattern-matching algorithms, IBM Journal of Research and Development, vol.31, issue.2, pp.249-260, 1987. ,
Efficient representation and counting of antipower factors in words, Language and Automata Theory and Applications, pp.421-433, 2019. ,
mreps: efficient and flexible detection of tandem repeats in DNA, Nucleic Acids Research, vol.31, issue.13, pp.3672-3678, 2003. ,
URL : https://hal.archives-ouvertes.fr/inria-00099597
A rigorous time bound for factoring integers, Journal of the American Mathematical Society, vol.5, issue.3, pp.483-516, 1992. ,
Pseudo-periodic partitions of biological sequences, Bioinformatics, vol.20, issue.3, pp.295-306, 2004. ,
, Combinatorics on Words, 1997.
URL : https://hal.archives-ouvertes.fr/hal-00620609
Algebraic Combinatorics on Words, 2002. ,
URL : https://hal.archives-ouvertes.fr/hal-00620608
Applied Combinatorics on Words, Encyclopedia of Mathematics and its Applications, 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-00620607
,
, Review of applied combinatorics on words. SIGACT News, vol.39, issue.3, pp.28-30, 2008.
Uber unendliche zeichenreihen, Norske Vid Selsk. Skr. I Mat-Nat Kl. (Christiana), vol.7, pp.1-22, 1906. ,