Advanced Search
Now showing items 1-10 of 68
RePair and All Irreducible Grammars are Upper Bounded by High-Order Empirical Entropy
(Institute of Electrical and Electronics Engineers Inc., 2019)
Lempel–Ziv compressed structures for document retrieval
(Elsevier Inc., 2019)
On the reproducibility of experiments of indexing repetitive document collections
(Elsevier Ltd, 2019)
GraCT: A Grammar-based Compressed Index for Trajectory Data
(Elsevier Inc., 2019)
Compressed Dynamic Range Majority Data Structures
(Institute of Electrical and Electronics Engineers Inc., 2017)
Document retrieval on repetitive string collections
(Springer, 2017-06)
Maximum-Weight Planar Boxes in O(n 2 ) Time (and Better)
(Elsevier, 2013)
Efficient Fully-Compressed Sequence Representations
(Springer, 2012)
Compressed vertical partitioning for efficient RDF management
(Springer, 2015)
The wavelet matrix: An efficient wavelet tree for large alphabets
(Elsevier, 2015)