No. Title Author Year
1 Acceleration of FM-Index Queries Through Prefix-Free Parsing Hong, Aaron et al. 2023
2 Lyndon Arrays in Sublinear Time Bannai, Hideo et al. 2023
3 Optimal LZ-End Parsing Is Hard Bannai, Hideo et al. 2023
4 Computing NP-Hard Repetitiveness Measures via MAX-SAT Bannai, Hideo et al. 2022
5 Front Matter, Table of Contents, Preface, Conference Organization Bannai, Hideo et al. 2022
6 LIPIcs, Volume 223, CPM 2022, Complete Volume Bannai, Hideo et al. 2022
7 Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time Bannai, Hideo et al. 2021
8 Repetitions in Strings: A "Constant" Problem (Invited Talk) Bannai, Hideo 2021
9 DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures Nakashima, Katsuhito et al. 2020
10 Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences Funakoshi, Mitsuru et al. 2020
11 An Improved Data Structure for Left-Right Maximal Generic Words Problem Fujishige, Yuta et al. 2019
12 Computing Runs on a Trie Sugahara, Ryo et al. 2019
13 Faster Queries for Longest Substring Palindrome After Block Edit Funakoshi, Mitsuru et al. 2019
14 Finding All Maximal Perfect Haplotype Blocks in Linear Time Alanko, Jarno et al. 2019
15 Indexing the Bijective BWT Bannai, Hideo et al. 2019
16 On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations Urabe, Yuki et al. 2019
17 Computing longest common square subsequences Inoue, Takafumi et al. 2018
18 Faster Online Elastic Degenerate String Matching Aoyama, Kotaro et al. 2018
19 Longest Lyndon Substring After Edit Urabe, Yuki et al. 2018
20 Longest substring palindrome after edit Funakoshi, Mitsuru et al. 2018
21 Lyndon Factorization of Grammar Compressed Texts Revisited Furuya, Isamu et al. 2018
22 Online LZ77 Parsing and Matching Statistics with RLBWTs Bannai, Hideo et al. 2018
23 Order-Preserving Pattern Matching Indeterminate Strings Henriques, Rui et al. 2018
24 Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings Fujishige, Yuta et al. 2017
25 Computing All Distinct Squares in Linear Time for Integer Alphabets Bannai, Hideo et al. 2017
26 Faster STR-IC-LCS Computation via RLE Kuboi, Keita et al. 2017
27 Small-Space LCE Data Structure with Constant-Time Queries Tanimura, Yuka et al. 2017
28 Tight Bounds on the Maximum Number of Shortest Unique Substrings Mieno, Takuya et al. 2017
29 Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets Fujishige, Yuta et al. 2016
30 Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction Tanimura, Yuka et al. 2016
31 Factorizing a String into Squares in Linear Time Matsuoka, Yoshiaki et al. 2016
32 Fully Dynamic Data Structure for LCE Queries in Compressed Space Nishimoto, Takaaki et al. 2016
33 Shortest Unique Substring Queries on Run-Length Encoded Strings Mieno, Takuya et al. 2016
34 Faster Compact On-Line Lempel-Ziv Factorization Yamamoto, Jun'ichi et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 34

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