{RePair} Grammars Are the Smallest Grammars for Fibonacci Words. | 0 | 0.34 | 2022 |
Minimal Absent Words on Run-Length Encoded Strings. | 0 | 0.34 | 2022 |
Cartesian Tree Subsequence Matching. | 0 | 0.34 | 2022 |
Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings. | 0 | 0.34 | 2022 |
Minimal Unique Palindromic Substrings After Single-Character Substitution. | 0 | 0.34 | 2021 |
A Separation of γ and b via Thue-Morse Words. | 0 | 0.34 | 2021 |
On the Approximation Ratio of LZ-End to LZ77. | 0 | 0.34 | 2021 |
String Sanitization Under Edit Distance - Improved and Generalized. | 0 | 0.34 | 2021 |
Tight bound on the maximum number of shortest unique substrings. | 1 | 0.35 | 2017 |
Shortest Unique Substring Queries on Run-Length Encoded Strings. | 3 | 0.42 | 2016 |