No. Title Author Year
1 Linear-Time Computation of Shortest Covers of All Rotations of a String Crochemore, Maxime et al. 2022
2 Longest Palindromic Substring in Sublinear Time Charalampopoulos, Panagiotis et al. 2022
3 Rectangular Tile Covers of 2D-Strings Radoszewski, Jakub et al. 2022
4 Computing Covers of 2D-Strings Charalampopoulos, Panagiotis et al. 2021
5 Faster Algorithms for Longest Common Substring Charalampopoulos, Panagiotis et al. 2021
6 Hardness of Detecting Abelian and Additive Square Factors in Strings Radoszewski, Jakub et al. 2021
7 Pattern Masking for Dictionary Matching Charalampopoulos, Panagiotis et al. 2021
8 Approximating Longest Common Substring with k mismatches: Theory and Practice Gourdel, Garance et al. 2020
9 Counting Distinct Patterns in Internal Dictionary Matching Charalampopoulos, Panagiotis et al. 2020
10 Efficient Computation of 2-Covers of a String Radoszewski, Jakub et al. 2020
11 k-Approximate Quasiperiodicity under Hamming and Edit Distance Kędzierski, Aleksander et al. 2020
12 The Number of Repetitions in 2D-Strings Charalampopoulos, Panagiotis et al. 2020
13 Unary Words Have the Smallest Levenshtein k-Neighbourhoods Charalampopoulos, Panagiotis et al. 2020
14 Internal Dictionary Matching Charalampopoulos, Panagiotis et al. 2019
15 Longest Common Substring Made Fully Dynamic Amir, Amihood et al. 2019
16 Quasi-Linear-Time Algorithm for Longest Common Circular Factor Alzamel, Mai et al. 2019
17 Quasi-Periodicity in Streams Gawrychowski, Pawel et al. 2019
18 Linear-Time Algorithm for Long LCF with k Mismatches Charalampopoulos, Panagiotis et al. 2018
19 String Periods in the Order-Preserving Model Gourdel, Garance et al. 2018
20 Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers Kärkkäinen, Juha et al. 2017
21 LIPIcs, Volume 78, CPM'17, Complete Volume Kärkkäinen, Juha et al. 2017
22 Efficient Index for Weighted Sequences Barton, Carl et al. 2016
23 Pattern Matching and Consensus Problems on Weighted Sequences and Profiles Kociumaka, Tomasz et al. 2016
24 Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties Iliopoulos, Costas S. et al. 2016
25 Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries Kociumaka, Tomasz et al. 2013
Current Page :
Number of result pages: 1
Number of documents: 25


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