INDEX909
register allocation, 450
regular, 440
regular polyhedron, 489
relation,seebinary relation
relaxed, 781 , 782
remainder, 246
remainder arithmetic,seemodular arith-
metic
Riemann Hypothesis, 275
ring,seecommutative ring
ring of integers modulon, 270
ripple-carry, 64 , 148
Rivest, Ronald, 279
root mean square, 795
routing,seecommunication net
RSA, 243, 279, 312
Rubin, Herman, 812
ruined, 839
Russel, Bertrand, 219, 222
Russell’s Paradox, 219, 222
sample space, 669 , 686
sampling, 829
satisfiability, 50
SAT, 55 , 281
SAT-solver, 56
satisfiable, 784
Schroder-Bernstein, 207, 227 ̈
self-loop, 395
self-loops, 321
sequence, 86
empty sequence, 86
set, 81
combining sets, 82
complement, 83
covering, 404
infinite set, 205
multiset, 81
power set, 83 , 211
set builder notation, 84
subset, 82 , 340, 362
set difference, 83
set theory, 220
Shamir, Adi, 279
Shapley, 412
simple graph, 393, 394
complete graph, 397
degree, 394
empty graph, 397
simple graphs, 241
Simpson’s Paradox, 712
sink, 857
smallest counterexample, 29
solid coloring, 430
spanning subgraph, 427
spanning tree, 427
square moduloN, 314
Square Multiple Rule, 798
square root, 304
square root ofsmoduloN, 314
stable distributions, 857
stable matching, 407
standard deviation, 14, 794 , 796, 799
star graph, 416
state machine, 31, 130 , 246, 250
execution, 134
stationary distribution, 852
Stirling’s Formula, 523
strict, 206
strictly decreasing, 142 , 512
strictly increasing, 142 , 512
strict subset, 82
strong induction, 124 , 129
strongly connected, 861
structure, 241
Subset Split Rule, 564
summation notation, 29 , 181
Sum Rule, 687
Sum Rule (counting), 554