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 Internal Dictionary Matching Charalampopoulos, Panagiotis et al. 2019
8 Quasi-Linear-Time Algorithm for Longest Common Circular Factor Alzamel, Mai et al. 2019
9 Linear-Time Algorithm for Long LCF with k Mismatches Charalampopoulos, Panagiotis et al. 2018
10 String Periods in the Order-Preserving Model Gourdel, Garance et al. 2018
11 Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers Kärkkäinen, Juha et al. 2017
12 LIPIcs, Volume 78, CPM'17, Complete Volume Kärkkäinen, Juha et al. 2017
13 Faster Longest Common Extension Queries in Strings over General Alphabets Gawrychowski, Pawel et al. 2016
14 Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries Kociumaka, Tomasz et al. 2013
15 08261 Abstracts Collection -- Structure-Based Compression of Complex Massive Data Böttcher, Stefan et al. 2008
16 08261 Executive Summary -- Structure-Based Compression of Complex Massive Data Böttcher, Stefan et al. 2008
Current Page :
Number of result pages: 1
Number of documents: 16


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