No. Title Author Year
1 Space Efficient Construction of Lyndon Arrays in Linear Time Bille, Philip et al. 2020
2 String Indexing with Compressed Patterns Bille, Philip et al. 2020
3 From Regular Expression Matching to Parsing Bille, Philip et al. 2019
4 Top Tree Compression of Tries Bille, Philip et al. 2019
5 Computation over Compressed Structured Data (Dagstuhl Seminar 16431) Bille, Philip et al. 2017
6 Deterministic Indexing for Packed Strings Bille, Philip et al. 2017
7 Fast Dynamic Arrays Bille, Philip et al. 2017
8 Lempel-Ziv Compression in a Sliding Window Bille, Philip et al. 2017
9 Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing Bille, Philip et al. 2017
10 Boxed Permutation Pattern Matching Amit, Mika et al. 2016
11 Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation Bille, Philip et al. 2016
12 Finger Search in Grammar-Compressed Strings Bille, Philip et al. 2016
13 Optimal Packed String Matching Ben-Kiki, Oren et al. 2011
Current Page :
Number of result pages: 1
Number of documents: 13


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