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


DROPS-Home | Fulltext Search | Imprint Published by LZI