The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
Index (complete) inverse exponential function Kruskal's algorithm, linked list local replacement logarithm logic problem longest increasing subsequence longest path lower bound lower bound - sorting mainframe computers Maple master theorem, , Mathematica mathematical induction matrix multiplication, matrix multiplication - applications maze median mergesort minimum spanning tree, mode monotonic sequence morphing motion planning movie stars multigraph nearest neighbor heuristic non-comparison based sorting non-deterministic Turning machine NP NP-completeness NP-completeness - dealing with it open addressing optimization problem optimizing programs for speed order-statistic tree file:///E|/LEC/LECTUR16/INDEX_AL.HTM (5 of 8) [19/1/2003 1:37:56]
Index (complete) parenthesization partial order partitioning step path path compression permutations - generation pivot pointers polygon triangulation polynomial time predecessor Prim's algorithm principle of optimality priority queue, problem, problem solving techniques, pseudocode P vs. NP, queens problem queue, , quicksort, quicksort - analysis RAM model of computation random-access machine randomized algorithm, recurrence relations recursion tree, , red-black tree red-black trees reduction, reduction - direction of refrain refrigerator restriction robot arm file:///E|/LEC/LECTUR16/INDEX_AL.HTM (6 of 8) [19/1/2003 1:37:56]
- Page 1253 and 1254: 1.6.16 Minkowski Sum Go to the corr
- Page 1255 and 1256: 1.7.1 Set Cover ● Set Packing ●
- Page 1257 and 1258: 1.7.2 Set Packing Go to the corresp
- Page 1259 and 1260: 1.7.3 String Matching ● Approxima
- Page 1261 and 1262: 1.7.4 Approximate String Matching
- Page 1263 and 1264: 1.7.5 Text Compression Go to the co
- Page 1265 and 1266: 1.7.6 Cryptography ● Text Compres
- Page 1267 and 1268: 1.7.7 Finite State Machine Minimiza
- Page 1269 and 1270: 1.7.8 Longest Common Substring ●
- Page 1271 and 1272: 1.7.9 Shortest Common Superstring G
- Page 1273 and 1274: Handbook of Algorithms and Data Str
- Page 1275 and 1276: Moret and Shapiro's Algorithms P to
- Page 1277 and 1278: Index B Up: Index - All Index: B ba
- Page 1279 and 1280: Index C Up: Index - All Index: C ch
- Page 1281 and 1282: Index E Up: Index - All Index: E ed
- Page 1283 and 1284: Index G Up: Index - All Index: G ga
- Page 1285 and 1286: Index I Up: Index - All Index: I in
- Page 1287 and 1288: Index L Up: Index - All Index: L li
- Page 1289 and 1290: Index N Up: Index - All Index: N ne
- Page 1291 and 1292: Index P Up: Index - All Index: P pa
- Page 1293 and 1294: Index R Up: Index - All Index: R RA
- Page 1295 and 1296: Index S successor supercomputer , s
- Page 1297 and 1298: Index U Up: Index - All Index: U un
- Page 1299 and 1300: Index W Up: Index - All Index: W wo
- Page 1301 and 1302: Index (complete) bin packing bipart
- Page 1303: Index (complete) Fourier transform
- Page 1307 and 1308: Index (complete) symmetry, exploiti
- Page 1309 and 1310: Ranger - Nearest Neighbor Search in
- Page 1311 and 1312: DIMACS Implementation Challenges Pe
- Page 1313 and 1314: Stony Brook Project Implementations
- Page 1315 and 1316: Clarkson's higher dimensional conve
- Page 1317 and 1318: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1319 and 1320: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1321 and 1322: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1323 and 1324: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1325 and 1326: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1327 and 1328: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1329 and 1330: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1331 and 1332: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1333 and 1334: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1335 and 1336: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1337 and 1338: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1339 and 1340: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1341 and 1342: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1343 and 1344: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1345 and 1346: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1347 and 1348: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1349 and 1350: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1351 and 1352: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1353 and 1354: file:///E|/WEBSITE/BIBLIO/TESTDATA/
Index (complete)<br />
parenthesization<br />
partial order<br />
partitioning step<br />
path<br />
path compression<br />
permutations - generation<br />
pivot<br />
pointers<br />
polygon triangulation<br />
polynomial time<br />
predecessor<br />
Prim's algorithm<br />
principle of optimality<br />
priority queue,<br />
problem,<br />
problem solving techniques,<br />
pseudocode<br />
P vs. NP,<br />
queens problem<br />
queue, ,<br />
quicksort,<br />
quicksort - analysis<br />
RAM model of computation<br />
random-access machine<br />
randomized algorithm,<br />
recurrence relations<br />
recursion tree, ,<br />
red-black tree<br />
red-black trees<br />
reduction,<br />
reduction - direction of<br />
refrain<br />
refrigerator<br />
restriction<br />
robot arm<br />
file:///E|/LEC/LECTUR16/INDEX_AL.HTM (6 of 8) [19/1/2003 1:37:56]
Change language