No. Title Author Year
1 Linear-Time Computation of Shortest Covers of All Rotations of a String Crochemore, Maxime et al. 2022
2 Rectangular Tile Covers of 2D-Strings Radoszewski, Jakub et al. 2022
3 Computing Covers of 2D-Strings Charalampopoulos, Panagiotis et al. 2021
4 Hardness of Detecting Abelian and Additive Square Factors in Strings Radoszewski, Jakub et al. 2021
5 Counting Distinct Patterns in Internal Dictionary Matching Charalampopoulos, Panagiotis et al. 2020
6 The Number of Repetitions in 2D-Strings Charalampopoulos, Panagiotis et al. 2020
7 Unary Words Have the Smallest Levenshtein k-Neighbourhoods Charalampopoulos, Panagiotis et al. 2020
8 Quasi-Linear-Time Algorithm for Longest Common Circular Factor Alzamel, Mai et al. 2019
Current Page :
Number of result pages: 1
Number of documents: 8


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