We give the first optimal algorithm for estimating the number of distinct elements in a data
stream, closing a long line of theoretical research on this problem begun by Flajolet and …

This article surveys the many facets of the Minimum Spanning Tree problem. We follow the
history of the problem since the first polynomial-time solution by Bor˚ uvka to the modern …

We present simple, practical and efficient data structures for the fundamental problem of
maintaining a resizable one-dimensional array, A [l.. l+ n− 1], of fixed-size elements, as …

The field of succinct data structures has flourished over the past 16 years. Starting from the
compressed suffix array by Grossi and Vitter (STOC 2000) and the FM-index by Ferragina …

A sketch of a dataset is a small-space data structure supporting some prespecified set of
queries (and possibly updates) while consuming space substantially sublinear in the space …

We show that on a RAM with addition, subtraction, bitwise Boolean operations and shifts, but
no multiplication, there is a transdichotomous solution to the static dictionary problem using …

We propose several modifications to the binary buddy system for managing dynamic
allocation of memory blocks whose sizes are powers of two. The standard buddy system …

We present a new data structure of size 3M bits, where M is the size of the universe at hand,
for realizing a discrete priority queue. When this data structure is used in combination with a …

The problem of estimating the pth moment F_p (p nonnegative and real) in data streams is
as follows. There is a vector x which starts at 0, and many updates of the form x_i<--x_i+ v …

Since J. McCarthy first introduced Functional Programming, the Linked List has almost
universally been used as the underpinning data structure. This paper introduces a new data …