In recent years there has been an increased interest in managing data that does not conform
to traditional data models, like the relational or object oriented model. The reasons for this …

The signature-file access method for text retrieval is studied. According to this method,
documents are stored sequentially in the" text file." Abstractions (" signatures") of the …

Asymptotic enumeration methods provide quantitative information about the rate of growth of
functions that count combinatorial objects. Typical questions that these methods answer …

High order differences of simple number sequences may be analysed asymptotically by
means of integral representations, residue calculus, and contour integration. This technique …

Consider some model of random finite trees of increasing size. It often happens that the
subtree at a uniform random vertex converges in distribution to a limit random tree. We …

Many applications depend on efficient management of large sets of distinct strings in
memory. For example, during index construction for text databases a record is held for each …

Publisher Summary This chapter discusses the analytic methods for average-case analysis
of algorithms, with special emphasis on the main algorithms and data structures used for …

Random binary search trees, b-ary search trees, median-of-(2k+ 1) trees, quadtrees, simplex
trees, tries, and digital search trees are special cases of random split trees. For these trees …

We give a partial overview of some results from the rich theory of branching processes and
illustrate their use in the probabilistic analysis of algorithms and data structures. The …

The Lempel-Ziv parsing scheme finds a wide range of applications, most notably in data
compression and algorithms on words. It partitions a sequence of length n into variable …