19th Annual Symposium on Foundations of Computerâ€¦

1978

When selecting from, or sorting, a file stored on a read-only tape and the internal storage is rather limited, several passes of the input tape may be required. We study the relation between theâ€¦ (More)

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 amount of spaceâ€¦ (More)

This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, we turn our attentionâ€¦ (More)

We consider a router on the Internet analyzing the statistical properties of a TCP/IP packet stream. A fundamental difficulty with measuring traffic behavior on the Internet is that there is simplyâ€¦ (More)

We consider a generalization of the problem of supporting rank and select queries on binary strings. Given a string of length <i>n</i> from an alphabet of size Ïƒ, we give the first representationâ€¦ (More)

We present a new representation for suffix trees, a data structure used in full text searching, that uses little more storage than the lg n bits per index point required to store the list of indexâ€¦ (More)

Motivated by boolean queries in text database systems, we consider the problems of nding the intersection, union, or diierence of a collection of sorted sets. While the worst-case complexity of theseâ€¦ (More)

17th Annual Symposium on Foundations of Computerâ€¦

1976

We consider heuristics which attempt to maintain a binary search tree in a near optimal form, assuming that elements are requested with fixed, but unknown, independent probabilities. A "move to root"â€¦ (More)