We deal with the problem of a center sending a message to a group of users such that some
subset of the users is considered revoked and should not be able to obtain the content of the …

We consider the indexable dictionary problem, which consists of storing a set S⊆{0,…, m−
1} for some integer m while supporting the operations of rank (x), which returns the number …

We design two compressed data structures for the full-text indexing problem that support
efficient substring searches using roughly the space required for storing the text in …

The proliferation of online text, such as on the World Wide Web and in databases, motivates
the need for space-efficient index methods that support fast search. Consider a text T of n …

We present a simple and efficient dictionary with worst case constant lookup time, equaling
the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger …

We introduce the Bloomier filter, a data structure for compactly encoding a function with
static support in order to support approximate evaluation queries. Our construction …

Search has been vital to artificial intelligence from the very beginning as a core technique in
problem solving. The authors present a thorough overview of heuristic search with a balance …

Delivering messages between pairs of processors is a basic and primary activity of any
distributed communication network. This task is performed using a routing scheme, which is …

We consider the implementation of abstract data types for the static objects: binary tree,
rooted ordered tree, and a balanced sequence of parentheses. Our representations use an …

Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …