No. Title Author Year
1 Predecessor on the Ultra-Wide Word RAM Bille, Philip et al. 2022
2 The Fine-Grained Complexity of Episode Matching Bille, Philip et al. 2022
3 Gapped Indexing for Consecutive Occurrences Bille, Philip et al. 2021
4 Random Access in Persistent Strings Bille, Philip et al. 2020
5 Space Efficient Construction of Lyndon Arrays in Linear Time Bille, Philip et al. 2020
6 String Indexing for Top-k Close Consecutive Occurrences Bille, Philip et al. 2020
7 String Indexing with Compressed Patterns Bille, Philip et al. 2020
8 From Regular Expression Matching to Parsing Bille, Philip et al. 2019
9 Top Tree Compression of Tries Bille, Philip et al. 2019
10 Computation over Compressed Structured Data (Dagstuhl Seminar 16431) Bille, Philip et al. 2017
11 Deterministic Indexing for Packed Strings Bille, Philip et al. 2017
12 Fast Dynamic Arrays Bille, Philip et al. 2017
13 Lempel-Ziv Compression in a Sliding Window Bille, Philip et al. 2017
14 Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing Bille, Philip et al. 2017
15 Boxed Permutation Pattern Matching Amit, Mika et al. 2016
16 Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation Bille, Philip et al. 2016
17 Finger Search in Grammar-Compressed Strings Bille, Philip et al. 2016
18 Optimal Packed String Matching Ben-Kiki, Oren et al. 2011
Current Page :
Number of result pages: 1
Number of documents: 18


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