Advanced Search
Now showing items 1-10 of 18
Fully functional suffix trees and optimal text searching in BWT-Runs bounded space
(Assoc Computing Machinery, USA, 2020)
Tree path majority data structures
(Elsevier, 2020)
Fast and compact planar embeddings
(Elsevier, 2020)
Compressed Dynamic Range Majority and Minority Data Structures
(Springer, 2020)
An index for moving objects with constant-time access to their compressed trajectories
(Taylor & Francis, 2020)
Efficient Fully-Compressed Sequence Representations
(Springer, 2012)
Entropy-bounded representation of point grids
(Elsevier, 2014)
On the approximation ratio of Lempel-Ziv parsing
(Springer Verlag, 2018)
Relative Suffix Trees
(The British Computer Society, 2018-05)