This chapter contains a survey of various operations, algorithms, and system organizations
by which content addressability can be embodied in memory hardware. It includes logic …

Like the first edition, this second edition is a fine resource book that can be valuable to
teachers and learners of computer science as well as to computer science researchers and …

We present algorithms for efficient searching of regular expressions on preprocessed text,
using a Patricia tree as a logical model for the index. We obtain searching algorithms that …

It is shown how the theory of branching processes can be applied in the analysis of the
expected height of random trees. In particular, we will study the height of random binary …

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 …

We study three rules for the development of a sequence of finite subtrees {tn} of an infinite m-
ary tree t. Independent realizations {ω (n)} of a stationary ergodic process {ω} on m letters …

Digital trees, also known as tries, are a general purpose flexible data structure that
implements dictionaries built on sets of words. An analysis is given of three major …

We study a rule of growing a sequence {tn} of finite subtrees of an infinite m-ary tree T.
Independent copies {ω (n)} of a Bernoulli-type process ω on m letters are used to trace out a …

A class of trees occurs both in digital searching and in schemes for maintaining dynamic
hash tables. We study the distribution of height in these trees using the saddle point method …

Information Retrieval: CHAPTER 2: INTRODUCTION TO DATA STRUCTURES AND Next
Chapter Return to Table of Contents Previous Chapter CHAPTER 2: INTRODUCTION TO DATA …