research
∙
09/01/2022
Maximal Closed Substrings
A string is closed if it has length 1 or has a nonempty border without i...
share
research
∙
06/03/2021
Internal Shortest Absent Word Queries in Constant Time and Linear Space
Given a string T of length n over an alphabet Σ⊂{1,2,…,n^O(1)} of size σ...
research
∙
11/25/2020
Left Lyndon tree construction
We extend the left-to-right Lyndon factorisation of a word to the left L...
research
∙
02/13/2019
Constructing Antidictionaries in Output-Sensitive Space
A word x that is absent from a word y is called minimal if all its prope...
research
∙
11/20/2018
Avoiding conjugacy classes on the 5-letter alphabet
We construct an infinite word w over the 5-letter alphabet such that for...
research
∙
05/25/2018
