| 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 |
| Compressed Communication Complexity Of Hamming Distance | 0 | 0.34 | 2021 |
| The Parameterized Suffix Tray | 0 | 0.34 | 2021 |
| Codeword Set Selection For The Error-Correcting 4b/10b Line Code With Maximum Clique Enumeration | 0 | 0.34 | 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 |
| Detecting $k$-(Sub-)Cadences and Equidistant Subsequence Occurrences | 0 | 0.34 | 2020 |
| DAWGs for parameterized matching: online construction and related indexing structures | 0 | 0.34 | 2020 |
| Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. | 0 | 0.34 | 2019 |
| Fabrication of Nb2O5 horizontal slot waveguide structures. | 0 | 0.34 | 2019 |
| Finding the Maximum Number of Symbols for the 4b/10b Line Code with Error Correction | 0 | 0.34 | 2019 |
| 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 |
| Computing Abelian regularities on RLE strings. | 3 | 0.51 | 2017 |
| Tight bound on the maximum number of shortest unique substrings. | 1 | 0.35 | 2017 |
| THE "RUNS" THEOREM | 25 | 1.08 | 2017 |
| Faster STR-IC-LCS computation via RLE. | 0 | 0.34 | 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 |
| Generalized pattern matching and periodicity under substring consistent equivalence relations. | 0 | 0.34 | 2016 |
| Fully dynamic data structure for LCE queries in compressed space. | 8 | 0.50 | 2016 |
| Shortest Unique Substring Queries on Run-Length Encoded Strings. | 3 | 0.42 | 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 |
| Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree. | 0 | 0.34 | 2015 |
| A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String | 4 | 0.45 | 2015 |
| Compressed automata for dictionary matching | 2 | 0.37 | 2015 |
| Inferring Strings from Full Abelian Periods. | 1 | 0.36 | 2015 |
| LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding | 4 | 0.43 | 2015 |
| An Opportunistic Text Indexing Structure Based on Run Length Encoding. | 0 | 0.34 | 2015 |
| Dynamic index, LZ factorization, and LCE queries in compressed space. | 7 | 0.53 | 2015 |
| Computing Abelian Covers and Abelian Runs. | 2 | 0.45 | 2014 |
| Inferring Strings from Lyndon Factorization. | 1 | 0.36 | 2014 |
| A new characterization of maximal repetitions by Lyndon trees | 1 | 0.41 | 2014 |
| Shortest Unique Substrings Queries in Optimal Time. | 12 | 0.77 | 2014 |
| Efficient Lyndon Factorization Of Grammar Compressed Text | 10 | 0.53 | 2013 |
| From Run Length Encoding to LZ78 and Back Again | 6 | 0.46 | 2013 |
| Faster Compact On-Line Lempel-Ziv Factorization | 4 | 0.50 | 2013 |
| Detecting regularities on grammar-compressed strings. | 3 | 0.39 | 2013 |
| Palindrome pattern matching | 2 | 0.39 | 2013 |
| Computing Convolution on Grammar-Compressed Text | 2 | 0.37 | 2013 |
| Converting Slp To Lz78 In Almost Linear Time | 4 | 0.42 | 2013 |
| Efficient LZ78 factorization of grammar compressed text | 12 | 0.60 | 2012 |
| Eager XPath evaluation over XML streams | 0 | 0.34 | 2012 |
| Time and Space Efficient Lempel-Ziv Factorization based on Run Length Encoding | 1 | 0.38 | 2012 |
