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)
Latin America Regional special section
(Assoc Computing Machinery, 2020)
Compressed Dynamic Range Majority and Minority Data Structures
(Springer, 2020)
Fast and compact planar embeddings
(Elsevier, 2020)
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)
A grammar compression algorithm based on induced suffix sorting
(Institute of Electrical and Electronics Engineers Inc., 2018)
Universal compressed text indexing
(Elsevier, 2019)