We propose new succinct representations of ordinal trees and match various space/time
lower bounds. It is known that any n-node static tree can be represented in 2 n+ o (n) bits so …

We propose new succinct representations of ordinal trees, which have been studied
extensively. It is known that any n-node static tree can be represented in 2 n+ o (n) bits and a …

Suffix trees are by far the most important data structure in stringology, with a myriad of
applications in fields like bioinformatics and information retrieval. Classical representations …

The suffix tree data structure has been intensively described, studied and used in the
eighties and nineties, its linear-time construction counterbalancing his space-consuming …

Summary Extensible Markup Language (XML) documents consist of text data plus structured
data (markup). XPath allows to query both text and structure. Evaluating such hybrid queries …

The dynamic trie is a fundamental data structure with applications in many areas of
computer science. This paper proposes a new technique for maintaining a dynamic trie T of …

A compressed full-text self-index is a data structure that replaces a text and in addition gives
indexed access to it, while taking space proportional to the compressed text size. This is very …

The choice dictionary is introduced as a data structure that can be initialized with a
parameter $ n\in\mathbb {N}=\{1, 2,\ldots\} $ and subsequently maintains an initially empty …

Cardinal trees (or tries of degree kk) are a fundamental data structure, in particular for many
text-processing algorithms. Each node in a cardinal tree has at most kk children, each …

We study data structures for variants of range query problems. In particular, we consider (1)
the range minimum problem: given a multidimensional array, find the position of the …