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 …

A constraint network representation is presented for a combinatorial search problem: finding
values for a set of variables subject to a set of constraints. A theory of consistency levels in …

* The work described in this thesis was inspired by the need for a word hyphenation routine
as part «f Don Knuth's T^ jX typesetting system [1]. This system was initially designed in …

An efficient digital search algorithm that is based on an internal array structure called a
double array, which combines the fast access of a matrix form with the compactness of a list …

The primary goal of this article is to survey state-of-the-art indexing methods for approximate
dictionary searching. To improve understanding of the field, we introduce a taxonomy that …

A new internal array structure, called a double‐array, implementing a trie structure is
presented. The double‐array combines the fast access of a matrix form with the …

This paper accounts for a new technique of correcting isolated words in typed texts. A
language-dependent set of string substitutions reflects the surface form of errors that result …

Tries are the fastest tree-based data structures for managing strings in-memory, but are
space-intensive. The burst-trie is almost as fast but reduces space by collapsing trie-chains …

Moving routing tables from RAM to custom or semicustom VLSI can lower cost and boost
performance. The routing table problem is presented by discussing the available …