No. Title Author Year
1 Cartesian Tree Subsequence Matching Oizumi, Tsubasa et al. 2022
2 Minimal Absent Words on Run-Length Encoded Strings Akagi, Tooru et al. 2022
3 {RePair} Grammars Are the Smallest Grammars for Fibonacci Words Mieno, Takuya et al. 2022
4 A Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length Sakai, Yoshifumi et al. 2020
5 DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures Nakashima, Katsuhito et al. 2020
6 Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences Funakoshi, Mitsuru et al. 2020
7 An Improved Data Structure for Left-Right Maximal Generic Words Problem Fujishige, Yuta et al. 2019
8 Computing Runs on a Trie Sugahara, Ryo et al. 2019
9 Faster Queries for Longest Substring Palindrome After Block Edit Funakoshi, Mitsuru et al. 2019
10 On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations Urabe, Yuki et al. 2019
11 Online Algorithms for Constructing Linear-Size Suffix Trie Hendrian, Diptarama et al. 2019
12 Computing longest common square subsequences Inoue, Takafumi et al. 2018
13 Faster Online Elastic Degenerate String Matching Aoyama, Kotaro et al. 2018
14 Longest Lyndon Substring After Edit Urabe, Yuki et al. 2018
15 Longest substring palindrome after edit Funakoshi, Mitsuru et al. 2018
16 Lyndon Factorization of Grammar Compressed Texts Revisited Furuya, Isamu et al. 2018
17 Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings Fujishige, Yuta et al. 2017
18 Computing All Distinct Squares in Linear Time for Integer Alphabets Bannai, Hideo et al. 2017
19 Faster STR-IC-LCS Computation via RLE Kuboi, Keita et al. 2017
20 Small-Space LCE Data Structure with Constant-Time Queries Tanimura, Yuka et al. 2017
21 Tight Bounds on the Maximum Number of Shortest Unique Substrings Mieno, Takuya et al. 2017
22 Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets Fujishige, Yuta et al. 2016
23 Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction Tanimura, Yuka et al. 2016
24 Efficiently Finding All Maximal alpha-gapped Repeats Gawrychowski, Pawel et al. 2016
25 Factorizing a String into Squares in Linear Time Matsuoka, Yoshiaki et al. 2016
26 Fully Dynamic Data Structure for LCE Queries in Compressed Space Nishimoto, Takaaki et al. 2016
27 Fully-online Construction of Suffix Trees for Multiple Texts Takagi, Takuya et al. 2016
28 Shortest Unique Substring Queries on Run-Length Encoded Strings Mieno, Takuya et al. 2016
29 Faster Compact On-Line Lempel-Ziv Factorization Yamamoto, Jun'ichi et al. 2014
30 An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Program Matsubara, Wataru et al. 2008
Current Page :
Number of result pages: 1
Number of documents: 30


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI