1-2 brother trees
1-2 neighbour trees
1-2 son trees
1-2 trees
2-3 brother trees
2-3 trees
2-3-4 trees
\%-2 \% rule
accesses
accessing books
addition
addition chain
address region
address-calculation sort
addressing methods
album
algorithm definition
algorithm descriptions
algorithm format
algorithms code
alignment problem
alphabet size
alternating selection
alternation
amortized worst case
approximate matrix multiplication
approximate string matching
arbitrary precision approximating
arctan(x)
arithmetic algorithms
arithmetic-geometric mean
array indices
array merging
array of digits
array Search
array sorting
ASCII
asymptotic expansions
asymptotic expansions of sums
\sub containing ${\prm e}^{-x^{ }}$
asymptotic expansions of definite integrals containing ${\prm e}^{-x^{ }}$
asymptotic matrix multiplication
asymptotic notation
atomic operations
automaton simulation
average minimum accesses
AVL trees
B*-trees
B+-trees
$B_{k}$ tree
$BB( \alpha )$ trees
B-Tree insertion
B-tree variations
B-trees
balance of a node
balanced binary trees
balanced merge sort
balanced multiway trees
balanced nodes
balanced Quicksort
balanced trees
balancing by internal path reduction
balancing rules
basic algorithms
basic concepts
basic operations
basic operations multiplication/division
basic sequential search
basic sorting methods
bibliographic databases
biharmonic numbers
binary addition
binary decisions
binary trees used as priority queues
binary trie
binomial queues
bipartition search
bisection search
bit indexing
bit inspections
bit-map display
blocking factor
BNF productions
boolean expressions order
bottom-up construction
bottom-up radix sort
bounded balance trees
bounded disorder
Boyer--Moore text searching
Bradford's law
break
Brent's algorithm
Brent's hashing
Brent--Salamin
browsing text
brute force search
brute force text searching
bubble sort
bucket
bucket address
bucket binary tries
bucket sort
bucket tries
buckets
building procedures
business applications
C
calculated entry search
cascade merge sort
cellar hashing
centred search
chain
chaining hashing
circular paths
classical matrix multiplication
clustering
clustering free
coalesced hashing
coalesced hashing with cellar
coalescing chains
cocktail shaker sort
collision
collision resolution scheme
commutativity products
complete binary trees
complex arithmetic
complexity measures
complexity of multiplication
complexity of squaring
composite keys
composition
composition of Quicksort
compressed files
compressed tries
computed entry search
computing $\pi $
computing inverses complexity
computing logarithms
conformation
constraints for data objects
constructor
contamination
contamination hashing
continuous growth
control dictionary
control function
conventional data structures
corpora
counter heuristics
cyclic structures
d-prefix
D-trees
DASG
data processing
data processing sorting
data structure description
data processing distribution
database searching
DAWG
decimal operations
decreasing probability order
deletions in binary trees
deletions hashing
depth nodes
depth trie
derivatives
descending factorials
determinants
deterministic finite automaton {\it see} DFA
DFA
dichotomic search
dictionaries
sub external
dictionary structures
digit
digital B-trees
digital cardinality
digital decomposition
digital indexing
digital search trees
digital tree
digital trie
digitization
digits
diminishing increment sort
direct chaining hashing
directed acyclic subsequence graph {\it see} DASG
directed acyclic word graph {\it see} DAWG
directory
sub hashing
discrete rectangular distribution
disk cylinder
disk track
dispersion phase
distribution of authorship
distribution phase
distribution probability
distributions derived from empirical observation
distributions sort