Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ :: Электронная библиотека попечительского совета мехмата МГУ

Главная Ex Libris Книги Журналы Статьи Серии Каталог Wanted Загрузка ХудЛит Справка Поиск по индексам Поиск Форум

Авторизация

Поиск по указателям

Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ

Обсудите книгу на научном форуме

Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter

Название: Алгоритмы: построение и анализ

Авторы: Кормен Т., Лейзерсон Ч., Ривест Р.

Аннотация:

Книга представляет собой перевод учебника по курсу построения и анализа эффективных алгоритмов, написанного в Массачусетском технологическом институте; в ней разбираются важнейшие классы быстрых алгоритмов и приёмы их построения.
Изложение подробное и математически строгое. Книгу можно использовать в качестве учебника и справочника; она будет полезна как студентам, так и профессионалам в области computer science и программирования.

Язык:

Рубрика: Computer science/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 2000

Количество страниц: 955

Добавлена в каталог: 18.03.2006

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID

Предметный указатель

Counting-sort      171
CRCW      633
CRCW-алгоритм      643
CRCW-машина, моделирование на EREW-машине      648
Credit      341
CREW      633
Critical edge      550
Critical path      499 615
Cross edge      451
Cross product      811
Crossing edge      467
Cubic spline      712
Cut      406 467 545
CYCLE      89
Cycle shifter      622
Cycle simple      89
Cyclic group      756
d-ary heap      149
d-regular graph      556
d-ичная куча      149
d-регулярный граф      556
Dag      91 453
Dag-Shortest-PathS      497
de Morgan’s laws      80
Deadline      332
Decide      842
Decided in polynomial time      842
Decision problem      839
Decision trees      168
Decomposition      690 693
Degree      41 95 714
Degree-bound      714
DELETE      192 236
Dense graph      436 533
Depth      96 586 606
Depth-determination      431
Depth-first forest      446
Depth-first search      446
Depth-first tree      446
Deque      197
dequeue      197
Descendant      95
Descendant proper      95
Destination vertex      480
Determinant      676
Deviation      115
DFS      447
DFS-Visit      447
DFT      719 721 723
Diagonal matrix      671
Diameter      445
DICTIONARY      191
Difference      79
Difference constraints      500
Digital signature      760
Digraph      88
Dijkstra      489
Dijkstra’s algorithm      489
Direct addressing      213
Direct-Address-Delete      214
Direct-Address-Insert      214
Direct-Address-Search      214
Directed acyclic graph      453
Directed graph      88
Directed segment      811
Directed version (of an undirected graph)      90
Discharge      566
Discrete Fourier Transform      719 721 723
Discrete logarithm      757
Discrete probability distribution      108
Discrete random variable      112
Disjoint sets      80
Disjoint-set data structure      414
Disjoint-set forest      420
Disk      360
Distribute      528
Distribution, binomial      118
Distribution, geometric      117
Distributive      79 685
Divide      737
Divide-and-conquer      26 823 830
Divide-and-conquer multiplication      733
Division method      221
Divisor      737
Domain of a function      85
Dominating point      834
Double hashing      229
Double linked list      198
Dynamic order statistics      271
Dynamic programming      288
Dynamic set      191
Dynamic table      346
Dynamic trees      358
Early task      332
EDGE      88 451
Edge connectivity      552
Edge residual      543
Edit distance      311
Element      78
Elementary event      106
Empty binary tree      96
Empty language      842
Empty set      78 79
Empty stack      195
Empty string      781 842
Endpoint      278 811
enqueue      197
Entropy (Shannon)      105
Equal functions      85
Equal sets      78
Equivalence class      83
Equivalence modulo n      738
Equivalence relation      83
ERCW      633
EREW      633
EREW-алгоритм      643
Error bound relative      881
Escape problem      574
Essential term      682
Euclid      742
Euclidean norm      675
Euclidean traveling-salesman problem      309
Euclid’s algorithm      742
Euler tour      463
Euler-tour technique      640
Euler’s constant      233
Euler’s phi function      748
Euler’s theorem      756
Evaluation      716 734
Event      107
Event point      818
Event-driven simulation      147
Events conditionally independent      111
Events independent      109 110
Events mutually independent      110
Events pairwise independent      110
Exact-Subset-Sum      894
Excess flow      556
Exchange property      27
Exclusive-read      633
Exclusive-write      633
Executing the subroutine      23
Expectation      113
Expected running time      24
Expected value      113
Exponential      42
Exponential series      50
Extend-Shortest-Paths      512
Extended form of Euclid algorithm      744
Extended-Euclid      744

Extension      328 527
Exterior      305
External node      95
External path length      98
Factor      772
Factorial      44
Factorization      740 741
Failure      116
Fair coin      108
Fan-in      604 606 651
Fan-out      604 651
Farthest-pair problem      824
Fast Fourier Transform      714 723
Fast-Max      646
Faster-All-Pairs-Shortest-Paths      515
Father      95
Feasible solution      500
Fermat’s theorem      756
FFT      714 723
FFT-Base      730
Fib-Heap-Decrease-Key      406
Fib-Heap-Delete      409
Fib-Heap-Extract-Min      401
Fib-Heap-Insert      399
Fib-Heap-Link      402
Fib-Heap-Union      400
Fibonacci heap      395
Fibonacci numbers      45 76
Field      687
Field of an object      21
FIFO      194
Final-state function      789
Find-RootS      644
Find-Set      423
Fingerprint      763
Finite automaton      788
Finite group      746
Finite sequence      86
Finite set      81
Finite-Automation-Matcher      791
First-fit      898
Fixed-length code      320
Flipping a fair coin      108
FLOOR      41
Flow      536
Flow conservation      535 536
Flow integer-valued      553
Flow network      536
Floyd-Warshall      518
Floyd-Warshall’      522
Ford-Fulkerson      547
Ford-Fulkerson-Method      542
Forest      91 93 420
Formal power series      76
Forward edge      451
Forward substitution      690 691
Fractional knapsack problem      318
Free list      204
Free tree      91 92
Free-Object      205
Full adder      604
Full column rank      676
Full node      362
Full rank      676
Fully polynomial-time approximation scheme      881
Function      85
Function boolean      105
Function inverse      87
Function linear      23
Function monotonically decreasing (increasing)      41
Function polylogarithmically bounded      43
Function polynomially bounded      42
Function quadratic      24
Function strictly decreasing (increasing)      41
Function, generating      76
Gabow’s algorithm      506
Gap character      783
Garbage collector      204
Gaussian elimination      693
GCD      739
Generating function      76
Generator      749 756
Generic-MST      467
Generic-Preflow-Push      560
Geometric distribution      117
Geometric series      50
Gift wrapping      825
Globally clocked circuit      624
Golden ratio      45
Good suffix      801 805
Graham-Scan      824
Graham’s scan      810 823 824 836
Graph      88
Graph bipartite      91
Graph complete      91
Graph connected      90
Graph d-regular      556
Graph directed      88
Graph directed acyclic      453
Graph isomorphic      90
Graph semiconnected      461
Graph simple directed      90
Graph singly connected      453
Graph strongly connected      90
Graph undirected      88
Graph weighted      437
Graph-coloring problem      877
GRAPH-ISOMORPHISM      848
Graphic matroid      327
Greatest common divisor      739
Greedoid      336
Greedy      329
Greedy algorithm      313
Greedy-Activity-Selector      314
Greedy-choice property      317
Greedy-Set-Cover      890
Group      746
Half-cleaner      591
Hall’s theorem      556
Halting problem (проблема остановки)      837
Ham-Cycle      848
Ham-Path      849
Hamiltonian cycle      845 870
Hamiltonian graph      845
Hamiltonian path      848
Handshaking lemma      92
Harmonic series      51
Hash function      215
Hash of a queue      196
Hash table      215
Hash value      215
Hash-Insert      227
Hash-Search      227
Hashing simple uniform      218
Head (головка)      360
Head of a list      198
Heap      376 379
Heap binary      138
Heap d-ary (d-ичная куча)      149
Heap property      139
Heap-Extract-Max      147
Heap-Insert      148
Heap-ordered      379
Heapify      141
Heapsort      138 145
Height      139
Height function      557
Height of a tree      96
Hereditary family      327
Hermitian matrix      704

1 2 3 4 5 6 7 8 9 10 11

О проекте