scientific article; zbMATH DE number 6146456
From MaRDI portal
Publication:4910720
DOI10.4230/LIPIcs.STACS.2008.1359zbMath1259.68226MaRDI QIDQ4910720
M. Sohel Rahman, Costas S. Iliopoulos, Maxime Crochemore, Tomasz Walen, Marcin Kubica
Publication date: 19 March 2013
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_3ba7.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On succinct representations of binary trees, On position restricted substring searching in succinct space, Efficient Data Structures for the Orthogonal Range Successor Problem, Succinct Non-overlapping Indexing, Extracting powers and periods in a word from its runs structure, On compressing and indexing repetitive sequences, Space-efficient data-analysis queries on grids, Improved data structures for the orthogonal range successor problem, Two-dimensional range successor in optimal time and almost linear space, New algorithms on wavelet trees and applications to information retrieval, Improved algorithms for the range next value problem and applications, Generalized substring compression, I/O-efficient data structures for non-overlapping indexing, LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations, Substring Range Reporting, Substring range reporting, LRM-trees: compressed indices, adaptive sorting, and compressed permutations, On space efficient two dimensional range minimum data structures, Optimal prefix and suffix queries on texts, Succinct non-overlapping indexing, Faster entropy-bounded compressed suffix trees
