Advanced Search
Now showing items 1-10 of 115
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)
Fully functional suffix trees and optimal text searching in BWT-Runs bounded space
(Assoc Computing Machinery, USA, 2020)
Ranked document selection
(Elsevier, 2020)
Compressed Dynamic Range Majority and Minority Data Structures
(Springer, 2020)
Fully dynamic metric access methods based on hyperplane partitioning
(PERGAMON-ELSEVIER SCIENCE LTD, 2011-06)
Stronger Lempel-Ziv Based Compressed Text Indexing
(Springer, 2012)
Compressed vertical partitioning for efficient RDF management
(Springer, 2015)