Document retrieval is one of the best-established information retrieval activities since
the'60s, pervading all search engines. Its aim is to obtain, from a collection of text …

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 …

The wavelet tree is a versatile data structure that serves a number of purposes, from string
processing to computational geometry. It can be regarded as a device that represents a …

A central problem in computational geometry, range searching arises in many applications,
and a variety of geometric problems can be formulated as range-searching problems. A …

This book is a graduate-level textbook on data structures. A data structure is a method1 to
realize a set of operations on some data. The classical example is to keep track of a set of …

We give an-time algorithm for counting the number of inversions in a permutation on n
elements. This improves a long-standing previous bound of O (n lg n/lg lg n) that followed …

We show that a large fraction of the data-structure lower bounds known today in fact follow
by reduction from the communication complexity of lopsided (asymmetric) set disjointness …

We describe a data structure that supports access, rank, and select queries, as well as
symbol insertions and deletions, on a string S 1, n over alphabet 1..σ in time …

In this paper we develop a new technique for proving lower bounds on the update time and
query time of dynamic data structures in the cell probe model. With this technique, we prove …

This thesis is devoted to internal queries in texts, which ask to solve classic text-processing
problems for substrings of a given text. More precisely, the task is to preprocess a static …