|
|
 |
| Àâòîðèçàöèÿ |
|
|
|
| Ïîèñê ïî óêàçàòåëÿì |
|
|
|
|
|
|
|
 |
|
|
|
| Greene D.H., Knuth D.E. — Mathematics for the analysis of algorithms |
|
|
|
| Ïðåäìåòíûé óêàçàòåëü |
Abel — Plana formula 96
Abelian theorem 45
Aho, Alfred Vaino 27 30 77
Algebraic singularities 66—67
Amble, Ole 77 81
Ape 85—86
Apostol, Tom Mike 55 77
Asymptotic analysis 42—76 95—100 107—110
Bailey, Wilfred Norman 9 77
Balanced trees 30
Banana 85
Basic polynomials 8—9
Bell polynomials 74
Bender, Edward Anton 67 77
Bent, Samuel Watkins v
Bernoulli numbers 59
Bernoulli polynomials 58—59
beta function 110 118
Binary trees 30 87 95 98—100 see
Binomial identities 1—10
Bootstrapping 43 50 52 117
Bounded variation 56
Boyce, William Edward 15 77
Broder, Andrei v
Catalan numbers 111—113
Central limit theorem 71—74
Chebyshev's inequality 47
Chebyshev's inverse relation 6
Clarkson, Kenneth Lee v 105
Computer Science 255 aka 360 v 81—83
Comtet, Louis 68 77
Context-free grammar, unambiguous 88—89
Continued fractions 25—27
Contour integrals 65 68—70 72
Convergent to a continued fraction 26
Cookie Monster 31—34 37—40 112
Coupon collecting 112 115
Cycle leaders 21
Darboux's method 65—68 70
de Bruijn, Nicolaas Govert 26 43 46 77 78 96 99
de la Vallee Poussin, Charles Louis Xavier Joseph 60
Delange, Hubert 23 78
Diagonalization of series 69—70 108
Differencing recurrence relations 17
Differential equations 15 20 88 127
Digital sums 22
DiPrima, Richard Clyde 77
Disguised linear recurrences 25-27 115
Dissecting a sum 44 51—54
Divide and conquer 27
Doubilet, Peter 80
Doubly exponential sequences 27—30
Drysdale, Robert Lewis (Scot), III v
Egorychev, Georgii Petrovich 3
Egorychev, Georgii Petrovich, method of coefficients 3—4
Eigenoperators 31—41 114
Eikooc monster 112
Erdoes, Pal 78 82
Euler's constant 7 47 50 97 98
Euler's summation formula 47 53 58—59 96 118 119
Exponential integral 63
Factorial powers 7—9
Factoring algorithms 48
Factorization, distinct degree 48
Feder, Tomas 118
Ferguson, David Elton 84—85
Fibonacci numbers 30 113—114
Fibonacci permutations 111—114
Finite history reccurence relations 11 12-16
Fountain 116
Fredman, Michael Lawrence 23—25 78
Full history reccurence relations 11 17—20 86
Gamma function 74 110 118
Gamma-function method 110 119
Generating functions 4 7 12 14—15 16 20 25 31—41 65—76 85—94 98—99 104—106 117 125
Gessel, Ira Martin 3
Glaisher's constant 96
Golden ratio 30
Golomb, Solomon Wolf 29
Gould, Henry Wadsworth 6 7
Grading problem 107—110
Graham, Ronald Lewis 2 9 12 59 78 105 118
Grammar, context free, unambiguous 88—89
Greatest common divisor 71
Greene, Curtis 80
Greene, Daniel Hill iv v 81 82
Grid paths 3 107 108 127
Guibas, Leonidas Ioannis v 82
Hadamard product 70
Hardy, Godfrey Harold 26 46 62 78
Harmonic numbers, asymptotics 47 50
Harmonic numbers, examples 19—20 50 103 104 106 108
Harmonic numbers, identities 10
Hashing, coalesced 34—37
Hashing, secondary clustering 39—41 101 103—104
Hashing, uniform 38
Henrici, Peter 9 78 119
Hertz Foundation v
Hidden linear recurrences 25—27 115
Hobby, John Douglas 105
Hsu, Lee-Tsch Ching-Siur 6 78
Hwang, Lucius James 113
Hypergeometric series 9
IBM 118
Implicit equations 43
In situ permutation 21 81
Inclusion and exclusion 6
Induction from the other end 31 37—40 87
Inverse relations 5—7 61—62
Inversion table 86 105
Inversions 111 113
Irreducible polynomials 48
IRT 72—74
Jonassen, Arne Tormod 3 78
| Jordan, Camille 11 79
Kahaner, David Kenneth 80
Knuth, Donald Ervin iv v 2 3 7 9 11 12 14 17 21 23 24 30 37 41 43 48 59 60 63 66 68 77—79 81—83 86 95 96 98—99 105 108—110 115—119
l'Hospital's rule 68
Laplace's method 70—73 76
Late binding trees 101—106 124—128
Lattice paths 3 107 108 127
Laurent expansion 65 68
Lectures 81—82
Lee metric 109
Left-to-right extrema 102—105
Linear recurrences 11—20 25—27
Lueker, George Schick 14 79
Macsyma 90—94 114 122—123
Mairson, Harry George v
Median-of-three quicksort 18—20
Mellin transform 82 110
Merchant, Arif Abdulhussein 114
merging sequences 24
Mertens, Franz Carl Josef 63 79
Milne-Thomson, Louis Melville 11 80
Minvolution 24
Moebius inversion 61—62
National Science Foundation v
Newton's expansion 9
Newton's method 121 123
Nonuniform distribution 102—105
o-notation 43
Odlyzko, Andrew Michael 80 120—121
Office of Naval Research v
Olver, Frank William John 96
Open addressing see "Hashing"
Operator methods 8—9 31—41 85 87
Orthogonal relation 5
Page, Ewan Stafford 11 80
Parallel processing 116
Partial fractions 12—13 51
Partitions 48
Pascal's triangle 124 126
Patashnik, Oren 2 9 12 59 78 105 118
Paterson, Michael Stewart 31—41 112
Permutations, bubble sort 84 86
Permutations, cocktail shaker 84 86
Permutations, Fibonacci 111—113
Permutations, input model 102 104—106 113
Permutations, obtainable with a stack 83
Plass, Michael Frederick 24
Poisson summation formula 119
Pokeysort 112 115
Polynomials, basic 8—9
Polynomials, irreducible 48
Prime factors, distinct 60—64
Prime factors, unusual 95—98
Prime numbers, asymptotically 60 97
Quick, Jonathan Horatio 101 124 128
Radix exchange sort 7 109
Ramshaw, Lyle Harold 82
Read, Ronald Cedric 77
Recurrence relations, linear 11—20
Recurrence relations, nonlinear 21—30
Renyi, Alfred 78
Repertoire approach 17—20 103
Residue theorem 68 72 99 108—110 118 121
Rice, Stephan Oswald 78
Riemann zeta function 51 61—62
Riordan, John 5—7 80
Roots of polynomial 120—123
Rota, Gian-Carlo 8 9 80
Rouche's theorem 120—121
Rousseau, Cecil Clyde 4
Saddle point method 65 70—76
Schoenhage, Arnold 11 79
Secondary clustering 39—41 101
Sedgewick, Robert 80 81 82
Semi-invariants 71 76
Shifting the mean 74—76
Sir Whittaker, Edmund Taylor 80
Sliding operators 39—41 101 103—104
Sloane, Neal James Alexander 27 30 77
Spiegel, Murray R. 11 13 16 80
Stanley, Richard Peter 80
Stieltjes constants  98
Stieltjes integral 55—64
Stirling numbers 7 76 118
Stirling's approximation 47 109
Stolarsky, Kenneth Barry 23 80
Stolfi, Jorge 90
Summation by parts 56 108
Summation factors 14 16 87
Tangent 88
Tauberian theorem 46 49—50 54
Taylor's expansion, general 8
Thiele expansion 71—74
Trabb Pardo, Luis Isidoro 79
Trading tails 71
Trees, balanced binary 30
Trees, binary search 101—103 104—106 124—128
Trees, external path length 102—103
Trees, late binding 101—106 124—128
Trees, ordered oriented 25
Trees, representing binary 84—85 87
Trees, total path length 105
Trees, traversing binary 95 98—100
Undetermined coefficients 13
Vandermonde's theorem 9
Variance 33 47 87 115 117
Vitter, Jeffrey Scott v
Watson, George Neville 80
Wilson, Leslie Blackett 11 79
Winkler, Phyllis Astrid Benson v
Wright, Edward Maitland 26 78
Xerox Corporation iv v
Yao, Andrew Chi-Chih v
Zave, Derek Alan 10 80
Zeta function 51 61—62
|
|
|
| Ðåêëàìà |
|
|
|
|
|
Î ïðîåêòå