Advanced Search
Now showing items 41-50 of 119
Relative Suffix Trees
(The British Computer Society, 2018-05)
Compressed Text Indexes with Fast Locate
(Springer Berlin Heidelberg, 2007)
Fully functional suffix trees and optimal text searching in BWT-Runs bounded space
(Assoc Computing Machinery, USA, 2020)
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)
Latin America Regional special section
(Assoc Computing Machinery, 2020)
Compressed Dynamic Range Majority and Minority Data Structures
(Springer, 2020)
Predecessor Search
(Assoc Computing Machinery, USA, 2020)
Fast and compact planar embeddings
(Elsevier, 2020)