|
|
Электронная библиотека Попечительского совета
механико-математического факультета
Московского государственного университета
|
|
|
|
|
|
| Horowitz E., Rajasekaran S., Sahui S. - Computer Algorithms |
|
|
|
| Предметный указатель |
 -approximate algorithms 558 566-575
 58
15-puzzle 382-386
2-3 tree 88-89 100
4-queens 346
8-Queens 340 353-357
Absolute approximation algorithm 558 561-565
Ackermann's function 14
Adelman, R. 447
Adjacency list 119
Adjacency matrix 118
Adjacency multilists 123
Adversary argument 458 466-473
Aho, A.V. 456 494 553
Algebraic problems 417-456
Algorithm, definition 1-4
Algorithm, specification 5
All pairs shortest paths, hypercube 754
All pairs shortest paths, mesh 711-712
All pairs shortest paths, PRAM 655
Alon, N. 664
Amdahl's Law 608
Amortization 89-90
And/or graphs 526-530
Appel, K.I. 374
Approximation algorithms 557-604
Asymptotic notation (O,  , etc.) 29
Asymptotic speedup 606
Atallah, M. 719
AVL tree 88-89
Azar, Y. 664
B-tree 88-89
Bach, E. 456
Backtracking 339-378
Baeza-Yates 126
Balancing principle 435
Belaga 492
Bellman, R.E. 307 308
Bernoulli trial 56
Best fit 570
Best fit decreasing 571
BFS 320-323
Biconnected components 329-336
Bin packing 569
Binary search 131-138
binary search trees 83-89
Binary search trees, optimal 275-282
Binary tree of processors 719
Binary trees 78-81 313-318
Binary trees, complete 79
Binary trees, full 79
Binary trees, inorder traversal 314
Binary trees, postorder traversal 315
Binary trees, preorder traversal 315
Binary trees, skewed 78
Binary trees, triple order traversal 318-319
Binomial distribution 56
Binomial heap 99
Bisection width 680
Bitonic merge 750-751
Bitonic sort 752-753
Blum, M. 194
Bopanna, R.B. 664
Borodin, A.B. 456 486 493
Bounding functions 340 369 388-391
Branch and bound 379-416
Branch and bound, FIFO 391 397-401
Branch and bound, LC 392 394-397
BREADTH FIRST SEARCH 320-323
Brebner, G. 718 757
Brigham, O. 456
Broadcasting on a hypercube 737
Broadcasting on a mesh 681
Bruno, J. 553
Brute force method 339
Bucket sort 194-195
Butterfly network 726
Chen, W. 718 757
Chernoff bounds 57
Children, in a tree 77
Chinese remainder theorem 438 444
Chromatic number 360 521-522 560
| Circuit realization 553
CLIQUE see "Maximum clique"
CLIQUE COVER 532
Code generation problems 540-549
Coffman, E.G., Jr. 553
Coin changing 250
Cole, R. 664
Colorability 551 556
Comparison trees 458-465
Complexity classes 504-507
Concentrator location 554
Conditional probability 54
Conjunctive normal form 502
Connected components 325-327
Control abstraction 198
Convex hull, hypercube 755-756
Convex hull, lower bound 475-476
Convex hull, mesh 713-717
Convex hull, PRAM 656-658
Convex hull, sequential 183-193
Convolution 721 758
Cook's theorem 508-516
Cook, S.A. 505
Cooley, J.M. 431 456
Coppersmith, D. 194
Cormen, T.H. 68
CRCW PRAM 610
CREW PRAM 610
Cube connected cycles 758
CYCLE COVER 601
Cypher, R. 758
D-search 325 344 346 379
Data concentration on a hypercube 739-742
Data concentration on a mesh 685-686
Data structures 69-126
Data structures, queues 73-75
Data structures, tacks 69-73
Data structures, trees 76-81
Deaps 100
Decision algorithm 498-499
Decision problem 498
Degree of a tree 77
Demers, A. 572
Denardo, E.V. 308
Depth first search 323-325
DFS 323-325
Diameter 680
Dictionaries 81-90
Dietz, P. 494
Diffie 447
Dijkstra, E.W. 250
Disjoint set union 101-110
Disjunctive normal form 503
Divide-and-conquer 127-196
Dixon, B. 249
Dobkin, D. 494
Dominance counting 659
Dominance rules 288 414 586
Dreyfus, S.E. 307
Dynamic programming 253-312
Embedding 727-732
Embedding a binary tree 730-732
Embedding a ring 728-729
Embedding a torus 730
Eppstein, D. 663
EREW PRAM 610
Euclid's Algorithm 441-444
Euler 112
Exact cover 533
Expected value 55
exponentiation 35-37
External path length 136
Fast Fourier Transform 430-439
Fast Fourier Transform, in-place 435-438
Fast Fourier Transform, nonrecursive 435-438
Feedback arc set 532
Feedback node set 530
Fermat's theorem 61
FFT 430-439 627 691 721 758
Fibonacci heap 100
Fibonacci numbers 26 429
Fiduccia, C. 183 494
|
|
|
| Реклама |
|
|
|
|
|
|
|
|
О проекте