| c-trie++: A dynamic trie tailored for fast prefix searches | 0 | 0.34 | 2022 |
| Palindromic trees for a sliding window and its applications | 0 | 0.34 | 2022 |
| Minimal Absent Words on Run-Length Encoded Strings. | 0 | 0.34 | 2022 |
| Longest Common Rollercoasters. | 0 | 0.34 | 2021 |
| Efficiently Computing Runs On A Trie | 0 | 0.34 | 2021 |
| Grammar Index by Induced Suffix Sorting. | 1 | 0.37 | 2021 |
| On the Approximation Ratio of LZ-End to LZ77. | 0 | 0.34 | 2021 |
| Counting Lyndon Subsequences. | 0 | 0.34 | 2021 |
| Position Heaps for Cartesian-Tree Matching on Strings and Tries. | 0 | 0.34 | 2021 |
| The Parameterized Suffix Tray | 0 | 0.34 | 2021 |
| Computing Longest Palindromic Substring After Single-Character Or Block-Wise Edits | 1 | 0.37 | 2021 |
| Towards Efficient Interactive Computation of Dynamic Time Warping Distance | 0 | 0.34 | 2020 |
| On repetitiveness measures of Thue-Morse words | 0 | 0.34 | 2020 |
| Space-efficient algorithms for computing minimal/shortest unique substrings. | 0 | 0.34 | 2020 |
| Detecting $k$-(Sub-)Cadences and Equidistant Subsequence Occurrences | 0 | 0.34 | 2020 |
| Practical Grammar Compression Based on Maximal Repeats. | 0 | 0.34 | 2020 |
| Lyndon Words, the Three Squares Lemma, and Primitive Squares | 0 | 0.34 | 2020 |
| DAWGs for parameterized matching: online construction and related indexing structures | 0 | 0.34 | 2020 |
| c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches | 0 | 0.34 | 2020 |
| Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings | 0 | 0.34 | 2020 |
| An Improved Data Structure for Left-Right Maximal Generic Words Problem. | 0 | 0.34 | 2019 |
| Compact Data Structures for Shortest Unique Substring Queries. | 0 | 0.34 | 2019 |
| The Parameterized Position Heap of a Trie. | 0 | 0.34 | 2019 |
| Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets. | 0 | 0.34 | 2019 |
| Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. | 0 | 0.34 | 2019 |
| On Longest Common Property Preserved Substring Queries. | 0 | 0.34 | 2019 |
| On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations. | 0 | 0.34 | 2019 |
| Mr-Repair: Grammar Compression Based On Maximal Repeats | 0 | 0.34 | 2019 |
| Computing Maximal Palindromes and Distinct Palindromes in a Trie. | 0 | 0.34 | 2019 |
| On the size of the smallest alphabet for Lyndon trees | 0 | 0.34 | 2019 |
| Faster queries for longest substring palindrome after block edit. | 0 | 0.34 | 2019 |
| Computing runs on a trie. | 0 | 0.34 | 2019 |
| Dynamic Packed Compact Tries Revisited. | 0 | 0.34 | 2019 |
| Faster Online Elastic Degenerate String Matching. | 0 | 0.34 | 2018 |
| Lyndon Factorization of Grammar Compressed Texts Revisited. | 0 | 0.34 | 2018 |
| Right-to-left online construction of parameterized position heaps. | 0 | 0.34 | 2018 |
| Longest substring palindrome after edit. | 0 | 0.34 | 2018 |
| O(n log n)-time text compression by LZ-style longest first substitution. | 0 | 0.34 | 2018 |
| Algorithms and combinatorial properties on shortest unique palindromic substrings. | 0 | 0.34 | 2018 |
| Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays. | 0 | 0.34 | 2018 |
| Longest Lyndon Substring After Edit. | 0 | 0.34 | 2018 |
| Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings. | 0 | 0.34 | 2017 |
| On the Size of Lempel-Ziv and Lyndon Factorizations. | 0 | 0.34 | 2017 |
| THE "RUNS" THEOREM | 25 | 1.08 | 2017 |
| On Reverse Engineering the Lyndon Tree. | 2 | 0.38 | 2017 |
| Longest Common Abelian Factors and Large Alphabets. | 3 | 0.47 | 2016 |
| Computing Left-Right Maximal Generic Words | 0 | 0.34 | 2015 |
| Constructing LZ78 Tries and Position Heaps in Linear Time for Large Alphabets. | 6 | 0.46 | 2015 |
| Inferring Strings from Lyndon Factorization. | 1 | 0.36 | 2014 |
| A new characterization of maximal repetitions by Lyndon trees | 1 | 0.41 | 2014 |
