| Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions | 0 | 0.34 | 2022 |
| Computing Longest (Common) Lyndon Subsequences. | 0 | 0.34 | 2022 |
| 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 |
| Computing NP-Hard Repetitiveness Measures via MAX-SAT | 0 | 0.34 | 2022 |
| Computing Minimal Unique Substrings for a Sliding Window | 0 | 0.34 | 2022 |
| The Smallest Grammar Problem Revisited | 0 | 0.34 | 2021 |
| 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 |
| Repetitions in Strings - A "Constant" Problem (Invited Talk). | 0 | 0.34 | 2021 |
| A Separation of γ and b via Thue-Morse Words. | 0 | 0.34 | 2021 |
| Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time. | 0 | 0.34 | 2021 |
| Refining the r-index | 2 | 0.38 | 2020 |
| Towards Efficient Interactive Computation of Dynamic Time Warping Distance | 0 | 0.34 | 2020 |
| Dynamic index and LZ factorization in compressed space | 5 | 0.42 | 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 |
| More Time-Space Tradeoffs For Finding A Shortest Unique Substring | 0 | 0.34 | 2020 |
| Practical Grammar Compression Based on Maximal Repeats. | 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 |
| Faster Online Elastic Degenerate String Matching. | 0 | 0.34 | 2018 |
| Block Palindromes: A New Generalization of Palindromes. | 0 | 0.34 | 2018 |
| Lyndon Factorization of Grammar Compressed Texts Revisited. | 0 | 0.34 | 2018 |
| Computing longest common square subsequences. | 0 | 0.34 | 2018 |
| Right-to-left online construction of parameterized position heaps. | 0 | 0.34 | 2018 |
| Order-Preserving Pattern Matching Indeterminate Strings. | 0 | 0.34 | 2018 |
| Longest substring palindrome after edit. | 0 | 0.34 | 2018 |
| Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings. | 0 | 0.34 | 2017 |
| Small-space encoding LCE data structure with constant-time queries. | 0 | 0.34 | 2017 |
| Order preserving pattern matching on trees and DAGs. | 0 | 0.34 | 2017 |
| Small-Space LCE Data Structure with Constant-Time Queries. | 1 | 0.37 | 2017 |
| Computing Abelian regularities on RLE strings. | 3 | 0.51 | 2017 |
| Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets. | 6 | 0.53 | 2016 |
| Factorizing a String into Squares in Linear Time. | 0 | 0.34 | 2016 |
| Finding Gapped Palindromes Online | 0 | 0.34 | 2016 |
| Deterministic sub-linear space LCE data structures with efficient construction. | 2 | 0.39 | 2016 |
| Closed Factorization. | 0 | 0.34 | 2016 |
| Generalized pattern matching and periodicity under substring consistent equivalence relations. | 0 | 0.34 | 2016 |
