288 INDEX
Dynamic programming, 138, 252-257
array-based methods, 252-255
dynamic matrix multiplication, 255-257
E
edgeCount variable, 161
Edges, 153
and biconnected component algorithm,
168, 169, 170
and breadth-first traversals, 151, 152, 153
and depth-first traversals, 150
and graph coloring, 220, 221
of graphs, 143, 144, 145, 146
in minimum spanning tree, 155, 159
and shortest-path algorithm, 163, 207,
208
Efficiency
of algorithms, 4-5, 9
recursive algorithm, 26-27
Eight queens problem, 247-249
solution to, 248
Elements
selection of, 53-54
else clause, 26, 173
end, 47, 48
ERCW. See Exclusive Read Concurrent Write
EREW. See Exclusive Read Exclusive Write
EREW PRAM model
broadcasting data in, 186-187
Errors
typing, 136
Evaluate function, 109
Exam schedules, conflict-free, 221
Exclusive access, 184
Exclusive Read Concurrent Write, 185
Exclusive Read Exclusive Write, 185
External polyphase merge sort, 57, 95-100
comparisons in run construction, 99
comparisons in run merge, 99-100
number of block reads, 100F
factorial function, 26, 27
Factorial, 2 5
Failure links, 126, 127
Fibonacci
calling sequence for, 253
Fibonacci numbers, 252, 253, 254
calculating, 31
FindRoot routine, 174
Finite automata
looking for substring “hello,” 125
First fit strategy, 235, 236
FixHeap, 78-79, 80, 81, 82
for loops, 6, 108
Formulas
average case result for insertion sort, 61
average case time, 12, 13
for binomial coefficient, 254
for complexity of divide and conquer
algorithm, 26
for recurrence relations, 32
for Strassen’s algorithm, 115
Fourier analysis, 107
Fringe nodes, 156, 157
Fully connected network configuration, 181G
Garey, M., 220
Gauss-Jordan method, 106, 117-119, 205, 272
GCD. See Greatest common divisor
Global counters, 38