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


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