No. Title Author Year
1 Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings Fujishige, Yuta et al. 2017
2 Faster STR-IC-LCS Computation via RLE Kuboi, Keita et al. 2017
3 Small-Space LCE Data Structure with Constant-Time Queries Tanimura, Yuka et al. 2017
4 Tight Bounds on the Maximum Number of Shortest Unique Substrings Mieno, Takuya et al. 2017
5 Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets Fujishige, Yuta et al. 2016
6 Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction Tanimura, Yuka et al. 2016
7 Factorizing a String into Squares in Linear Time Matsuoka, Yoshiaki et al. 2016
8 Fully Dynamic Data Structure for LCE Queries in Compressed Space Nishimoto, Takaaki et al. 2016
9 Shortest Unique Substring Queries on Run-Length Encoded Strings Mieno, Takuya et al. 2016
10 Faster Compact On-Line Lempel-Ziv Factorization Yamamoto, Jun'ichi et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 10


DROPS-Home | Fulltext Search | Imprint Published by LZI