Knuth D.E. — The art of computer programming (vol. 1 Fundаmental algorithms) :: Электронная библиотека попечительского совета мехмата МГУ

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

Авторизация

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

Knuth D.E. — The art of computer programming (vol. 1 Fundаmental algorithms)

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

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

Название: The art of computer programming (vol. 1 Fundаmental algorithms)

Автор: Knuth D.E.

Аннотация:

This first volume in the series begins with basic programming concepts and techniques, then focuses more particularly on information structures-the representation of information inside a computer, the structural relationships between data elements and how to deal with them efficiently. Elementary applications are given to simulation, numerical methods, symbolic computing, software and system design. Dozens of simple and important algorithms and techniques have been added to those of the previous edition. The section on mathematical preliminaries has been extensively revised to match present trends in research.

Язык:

Рубрика: Computer science/Алгоритмы/

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

ed2k: ed2k stats

Издание: third edition

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

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

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

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

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

-notation      107—111 118
-nomial coefficients      65 73 491
-nomial theorem      73 494
-ary trees      334 405
-ary trees, enumeration of      397 593
-ary trees, sequential allocation      401
$T_{E}X$       xi 202 611 650
, for complex numbers      21 108
$\phi$ (golden ratio)      13 18 21 80 83-86 619-620
$\pi$ (circle ratio)      21 619-620
$\pi$ (circle ratio), Wallis’s product for      52 116
${\L}$ ukasiewicz, Jan      338
()      164; see Identity permutation
0-2-trees      317
0-2-trees, oriented      398
0-origin indexing      254 282 299-301 305-306
2-d trees      564
A-register of MIX      125
Aardenne — Ehrenfest, Tatyana van      375 379
Aarons, Roger      528
Abel, binomial theorem      71—73 398
Abel, limit theorem      95
Abel, Niels Henrik      58 498
Absolute error      116
Absolute value      21
Absolutely convergent series      29
ACE computer      193 229
ACE computer, Pilot      230
Adams, Charles William      230
Add      131—132 208
Add to list      see Insertion
Addition of polynomials      275—280 357—359
Address field of MIXAL line      145 151—153
Address of node      233
Address portion of MIX instruction      127
Address transfer operators of MIX      133—134 210
Adjacent vertices of a graph      363
Adobe Systems      202
Agenda      288 291 296;
Aho, Alfred Vaino      560
Ahrens, Wilhelm Ernst Martin Georg      162
al — Khw $\bar{a}$ rizm $\bar{i}$ , Ab $\bar{u}$ ‘Abd All $\bar{a}$ h Muhammad ibn M $\bar{u}$ s $\bar{a}$       1 79
ALF (alphabetic data)      151 152 155
Algebraic formulas      313
Algebraic formulas, differentiation      90 338—347 459
Algebraic formulas, manipulation of      459—462
Algebraic formulas, representation as trees      337 459
Algebraic formulas, simplification of      339 347
ALGOL language      202 229
Algorithm, origin of word      1 2
Algorithms      1 9
Algorithms, analysis of      vi 7 96—107 170—172 179 250 253 268 278—280 324—326 331 380—382 444-445 451
Algorithms, communication of      16
Algorithms, effective      6 8 9
Algorithms, equivalence between      467
Algorithms, form of in this book      2—4
Algorithms, hardware-oriented      26 252 611
Algorithms, how to read      4 16
Algorithms, proof of      5—6 13—17 321 361 422 434
Algorithms, properties of      4—6 9
Algorithms, random paths in      380 381
Algorithms, set-theoretic definition      7—9
Algorithms, theory of      7 9
Allocation of tables      see Dynamic storage allocation Linked Representation Sequential
Alpern, Steven Robert      526
Alphameric character, codes for MIX      136 138 140—141
Amortized running time      254
Analysis of Algorithms      vi 7 96—107 170—172 179 250 253 268 278—280 324—326 331 380—382 444—445 451
Analytical engine      1 229
Ancestor, in a tree structure      311 348
Andr $\acute{e}$ , Antoine D $\acute{e}$ sir $\acute{e}$       536
Anticipated input      216; see Buffering
Antisymmetric relation      261
Apostol, Tom Mike      28
Ara $\acute{u}$ jo, Saulo      565
Arbogast, Louis Fran $\k{c}$ ois Antoine      52 105
Arborescences      363; see Oriented trees
Arc digraph      379
Arc in a directed graph      372
Area of memory      435
Arguments of subroutines      187 189
arithmetic expressions      see Algebraic formulas
Arithmetic fixed point      158
Arithmetic floating point      131 306
Arithmetic operators of MIX      131—133 208
Arithmetic polynomial      275—280 357—359 361
Arithmetic progression, sum of      11 32 56
Arithmetic scaled decimal      160—161
Arithmetic, Addition, subtraction, multiplication, and division      vi ix
Array, A table that usually has a -dimensional rectangular structure      4 232 298—307
Array, linked      301—307
Array, one-dimensional      see Linear list
Array, represented as a tree      315
Array, sequential allocation      159 299—301 305—307
Array, tetrahedral      300—301 306
Array, two-dimensional      see Matrix
Array, uninitialized      307
Arrows, used to represent links in diagrams      234
Assembly language, contrasted with high-level language      236 535
Assembly language, for MIX      144—157
Assembly program      145 153
Assigning a buffer      219—223 226—227
Assignment operation ( $\leftarrow$ )      3
Asterisk (“”) in assembly language      146 149 153
Asymmetric relations      261
Asymptotic values, derivation of      107—123 243 396—397 525 565
Atom (in a List)      315 408—412 418
Atom, purpose of      410
Automata theory      230 240 463—464
Automaton, An abstract machine that is defined formally, often intended to be a model of some aspects of actual computers (plural, Automata)      463—464
AVAIL stack, Available space list      256
Available space list      256—261 266 269 278 291 413—414 435—444
Available space list, history      458
Available space list, variable-size blocks      435—456
Average value of a random variable      97—98 103
Average value of a random variable, from a generating function      100—103
Babbage, Charles      1 229
Bachmann, Paul Gustav Heinrich      107
Backus, John Warner      230
Bailey, Michael John      462
Baker, Henry Givens, Jr      605
Balanced directed graph      374—375
Ball, Thomas Jaudon      369
Ball, Walter William Rouse      162
Ballot problem      536—537
Barnes, Ernest William      507
Barnett, Michael Peter      462
Barrington, David Arno      526
Barry, David McAlister, subtle reference to      xi 274
Barton, David Elliott      66 536
Base address      244
Bead      233; see Node
Before and after diagrams      260—261 278 281 571
Beigel, Richard      467
Bell Interpretive System      230
Bell, Eric Temple      87
Bellman, Richard Ernest      xv
Bendix G      20 124
Bennett, John Makepeace      230
Berger, Robert      385
Bergeron, Frangois      395
Bergman, George Mark      495 593
Berlekamp, Elwyn Ralph      273
Berman, Martin Fredric      523
Bernoulli numbers $B_{n}$       76 91 112—115
Bernoulli numbers, table      621
Bernoulli polynomials      44 113—115 503
Bernoulli, Jacques (= Jakob = James)      112 115
Bernoulli, Jean (= Johann = John), III      495
Bertrand, Joseph Louis Fran $\k{c}$ ois, postulate      512

Berztiss, Alfs Teodors      462
Best-fit method of storage allocation      436—437 447 453—456
Beta function B(x,y)      72
Bh $\bar{a}$ skara $\bar{A}$ ch $\bar{a}$ rya      53—54
Bienaym $\acute{e}$ , Ir $\acute{e}$ n $\acute{e}$ e Jules      98
Bienstock, Daniel      514
Big — Oh notation      107—111 118
Big — Omega notation      110—111
Big — Theta notation      110
Bigelow, Richard Henry      562
Binary logarithms      23 26
Binary number system      24 26
Binary trees      311—312 317 318—337 363 459
Binary trees, complete      401 405 563
Binary trees, copying of      329—330 333 347
Binary trees, correspondence to trees and forests      334—335 346
Binary trees, definition of      312
Binary trees, enumeration of      388 389 405
Binary trees, equivalent      328—329
Binary trees, erasing of      333
Binary trees, extended      399—406
Binary trees, linked      318
Binary trees, oriented      396—397
Binary trees, path length of      399—406
Binary trees, representation of      318 322 327 333—334
Binary trees, right-threaded      327 332—334
Binary trees, sequential      401
Binary trees, similar      327—329
Binary trees, threaded      322 331—332 460
Binary trees, traversal of      319—320 323 331—332 459-460
Binary trees, with shared subtrees      326 603
Binary trees, “Dewey” notation for      317 331 346 405
Binet, Jacques Philippe Marie      36 407 475 582
Binomial coefficients      52—74 89
Binomial coefficients, asymptotic values      72
Binomial coefficients, bounds on      74
Binomial coefficients, combinatorial interpretation      52—53 73
Binomial coefficients, defined      53
Binomial coefficients, generalized      65 72 85
Binomial coefficients, generating functions      90 94
Binomial coefficients, history      53—54
Binomial coefficients, sums involving      56—74 76—78 85 96
Binomial coefficients, table      54
Binomial distribution      101—102
Binomial distribution, tail      106
Binomial theorem      57—58 90
Binomial theorem, Abel’s generalization      71—73 398
Binomial theorem, generalizations of      64 70—73 90 398—399 488
Binomial theorem, Hurwitz’s generalization      399 488
Binomial tree      xx
Bipartite trees      398
Bitwise operations      442 455 510 553
Blaauw, Gerrit Anne      458
Blikle, Andrzej Jacek      329
Block of external data      136—137
block of memory      435
Blocking of records      218 225
Bobrow, Daniel Gureasko      421 460 461
Boles, David Alan      452
Bolzano, Bernhard      382
Boncompagni, Prince Baldassarre      79
Boothroyd, John      177
Bootstrapping      143
Borchardt, Carl Wilhelm      406 583
Bottom of stack      241
Bottom-up process      309 351
Boundary tag method of storage allocation      440—442 453—454 461
Bourne, Charles Percy      516
Bracket notation for coefficients      92
Bracket notation for logical statements      33; see Iverson’s convention
Branch node of tree      308
Breadth-first search      351
Brenner, Norman Mitchell      523
Brent, Richard Peirce      563
Briggs, Henry      26
Broline, Duane Marvin      601
Brother, in a tree structure      311
Brouwer, Luitzen Egbertus Jan      406
Bruijn, Nicolaas Govert de      121 122 375 379 380 478 504 543 565
Buddy system for storage allocation      444 447—448 454—456 461
Buffering of input-output      158 216—228
Buffering of input-output, history      231
Buffering of input-output, swapping      147 159 217—218 225
Bugs, Errors or defects      see Debugging
Burke, John      310
Burks, Arthur Walter      359
Burleson, Peter Barrus      462
Burroughs B220      124
Burroughs B5000      461
Busche, Conrad Heinrich Edmund Friedrich      43
busy waiting      216
Byte, Basic unit of data, usually associated with alphameric characters      125
Byte, in MIX      124—125 139
C language      556
Cache      528
Cajori, Florian      24
calendar      160
California Institute of Technology      x 282
Calling sequence      187—190 193 196—197
Campbell, John Arthur      450
Canonical cycle notation for permutations      178—179
Canonical representation of oriented trees      390—394 397—398 590-591
Capelli, Alfredo      50 71
Car, LISP terminology for the first component of a List; analogous to ALINK      415
Car, LISP terminology for the first component of a List; analogous to INFO and DLINK      411
Cards, playing      51 69 233—237 238 377—378
Cards, punched      136—137 152 229
Carlitz, Leonard      499 506 96
Carlyle, Thomas      xiv
Carpenter, Brian Edward      229
Carr, John Weber, III      458
Cassini, Jean Dominique      81
Catalan numbers      407
Catalan, Eug $\grave{e}$ ne Charles      407
Cate, Esko George      523
Cauchy, Augustin Louis      92 475 490 506 520 582
Cauchy, inequality, $(\sum a_{k}b_{k})^{2}\leq(\sum a^{2}_{k})(\sum b_{k}^{2})$       36
Cauchy, matrix      37—38 475
Cayley, Arthur      396 406—407 586 597
CDC1604 computer      124 529
Cdr, LISP terminology for the remainder of a List with its first component deleted; analogous to BLINK      415
Cdr, LISP terminology for the remainder of a List with its first component deleted; analogous to RLINK      411
Ceiling function       39 41
Cell, A word of the computer memory      127
Cellar      240
Central moment of a probability distribution      105
Centroid of a free tree      387—388 397 589
Ceulen, Ludolph van      596
Chain rule for differentiation      52
Chakravarti, Gurugovinda      53
Change of summation variable      28 32 33
Channel, A data-transmission device connected to a computer      224
CHAR (convert to characters)      138
Character codes of MIX      136 138 140—141
Characteristic function of a probability distribution      103
Characteristic polynomial of a matrix      499
Charles Philip Arthur George, Prince of Wales      310
Cheam, Tat Ong      450
Cheating      582
Chebyshev, Pafnutii Lvovich, inequality      98 104
Checkerboard      435—436
Checkerboarding      see Fragmentation
Chen, Tien Chi      471
Cheney, Christopher John      421
Cheney, Ednah Dow Littlehale      377
Chernoff, Herman      502
Chess      6 194 272
Child link      427—433
Children in tree structures      311 317 334—335 352
Chowla, Paromita      307

1 2 3 4 5 6 7

О проекте