|
Электронная библиотека Попечительского совета механико-математического факультета Московского государственного университета
|
|
|
|
|
Greene D.H., Knuth D.E. - Mathematics for the analysis of algorithms |
|
|
Предметный указатель |
Abel - Plana formula 100
Abelian theorem 49
Aho, Alfred Vaino 31 34 81
Algebraic singularities 70-71
Amble, Ole 81 85
Ape 89-90
Apostol, Tom Mike 59 81
Asymptotic analysis 46-80 99-104 111-114
Bailey, Wilfred Norman 13 81
Banana 89
Basic polynomials 12-13
Bell polynomials 78
Bender, Edward Anton 71 81
Bent, Samuel Watkins 2
Bernoulli numbers 63
Bernoulli polynomials 62-63
beta function 114
Binomial identities 5-14
Bootstrapping 47 54 56
Bounded variation 60
Boyce, William Edward 19 81
Broder, Andrei 2
Central limit theorem 75-78
Chebyshev's inequality 51
Chebyshev's inverse relation 10
Clarkson, Kenneth Lee 2 109
Computer Science 255 2 85-87
Comtet, Louis 72 81
Continued fractions 29-31
Contour integrals 69 72-74 76
Convergent to a continued fraction 30
Cookie Monster 35-38 41-44
Cycle leaders 25
Darboux's method 69-72 74
de Bruijn, Nicolaas Govert 30 47 50 81 82 103
de la Vallee Poussin, Charles Louis Xavier Joseph 64
Delange, Hubert 27 82
Diagonalization of series 73-74 112
Differencing recurrence relations 21
Differential equations 19 24 92 116 118
Digital sums 26
DiPrima, Richard Clyde 81
Dissecting a sum 48 55-58
Divide and conquer 31
Doubilet, Peter 84
Doubly exponential sequences 31-34
Drysdale, Robert Lewis (Scot), III 2
Egorychev's method of coefficients 7-8
Egorychev, Georgii Petrovich 7
Eigenoperators 35-45
Erdoes, Pal 82 86
Euler's constant 51 54
Euler's summation formula 51 57 62-63 100
Exponential integral 67
Factorial powers 11-13
Factoring algorithms 52
Factorization, distinct degree 52
Ferguson, David Elton 88-89
Fibonacci numbers 34
Finite history reccurence relations 15 16-20
Fredman, Michael Lawrence 27-29 82
Full history reccurence relations 15 21-24
Gamma function 78
Gamma function method 114
Generating functions 8 11 16 18-19 20 24 29 35-45 69-80 89-98 102-103 108-110 116
Gessel, Ira M. 7
Glaisher's constant 100
Golden ratio 34
Golomb, Solomon Wolf 33
Gould, Henry Wadsworth 10 11
Grading problem 111-114
Grammar, context free, unambiguous 92-93
Greatest common divisor 75
Greene, Curtis 84
Greene, Daniel Hill 1 85 86
Grid paths 7 111 112 117
Guibas, Leonidas Ioannis 2 86
Hadamard product 74
Hardy, Godfrey Harold 30 50 66 82
Harmonic numbers, asymptotics 51 54
Harmonic numbers, examples 23-24 54 107 108 110 112
Harmonic numbers, identities 14
Hashing, coalesced 38-41
Hashing, secondary clustering 43-45 105 107-108
Hashing, uniform 42
Henrici, Peter 13 82
Hobby, John Douglas 109
Hsu Li-Che 10 82
Hypergeometric series 13
Implicit equations 47
In situ permutation 25 85
Inclusion and exclusion 10
Induction from the other end 35 41-44 91
Inverse relations 9-11
Inversion table 90
| Irreducible polynomials 52
Jonassen, Arne Tormod 7 82
Jordan, Camille 15 83
Kahaner, David Kenneth 84
Knuth, Donald Ervin 1 2 6 11 15 16 18 21 25 27 34 45 47 52 64 67 70 71 81 83 85 86 87
l'Hospital's rule 72
Laplace's method 75-77 80
Lattice paths 7 111 112 117
Laurent expansion 69 72
Lectures 85-86
Lee metric 113
Lueker, George Schick 18 83
Macsyma 94-98
Mairson, Harry George 2
Median-of-three quicksort 22-24
merging sequences 28
METAFONT 2
Milne-Thomson, Louis Melville 15 83
Minvolution 28
Moebius inversion 65-66
Newton's expansion 13
o-notation 47
Odlyzko, Andrew Michael 84
Olver, Frank William John 100
Operator methods 12-13 35-45 89 91
Orthogonal relation 9
Page, Ewan Stafford 15 84
Partial fractions 16-17 55
Partitions 52
Pascal's triangle 115 117
Paterson, Michael Stewart 35-45
Permutations, bubble sort 88 90
Permutations, cocktail shaker 88 90
Permutations, input model 106 108-110 117
Permutations, obtainable with a stack 87
Plass, Michael Frederick 28
Polynomials, basic 12-13
Polynomials, irreducible 52
Prime factors, distinct 64-68
Prime factors, unusual 99-102
Prime numbers, asymptotics 64
Quick, Jonathan Horatio 105 115 119
Radix exchange sort 11 113
Ramshaw, Lyle Harold 86
Read, Ronald Cedric 81
Recurrence relations, linear 15-24
Recurrence relations, nonlinear 25-34
Renyi, Alfred 82
Repertoire approach 21-24 107
Residue theorem 72 76 103 112-114
Rice, Stephan Oswald 82
Riemann zeta function 55 65-66
Riordan, John 9-11 84
Rota, Gian-Carlo 12 13 84
Rousseau, Cecil Clyde 8
Saddle point method 69 74-80
Schoenhage, Arnold 15 83
Sedgewick, Robert 84 85 86
Semi-invariants 75 80
Shifting the mean 78-80
Slater, Lucy Joan 13 84
Sliding operators 43-45 105 107-108
Sloane, Neal James Alexander 31 34 81
Spiegel, Murray R. 15 17 20 84
Stanley, Richard Peter 84
Stieltjes integral 59-68
Stirling numbers 11 80
Stirling's approximation 51 113
Stolarsky, Kenneth Barry 27 84
Stolfi, Jorge 94
Summation by parts 60 112
Summation factors 18 20 91
Tauberian theorem 50 53-54 58
Taylor's expansion, general 12
TeX 2
Thiele expansion 75-78
Trabb Pardo, Luis Isidoro 83
Trees, balanced binary 34
Trees, binary search 105-107 108-110 115-119
Trees, external path length 106-107
Trees, late binding 105-107 108-110 115-119
Trees, ordered oriented 29
Trees, representing binary 88-89 91
Trees, total path length 109
Trees, traversing binary 99 102-104
Undetermined coefficients 17
Vandermonde's theorem 13
Vitter, Jeffrey Scott 2
Watson, George Neville 84
Whittaker, Sir Edmund Taylor 84
Wilson, Leslie Blackett 15 83
Winkler, Phyllis Astrid Benson 2
Wright, Edward Maitland 30 82
Yao, Andrew Chi-Chih 2
Zave, Derek Alan 14 84
Zeta function 55 65-66
|
|
|
Реклама |
|
|
|
|
|
|