| Robert Sedgewick 斯坦福大学博士(导师为Donald E. Knuth)，普林斯顿大学计算机科学系教授，Adobe Systems公司董事，曾是Xerox PARC的研究人员，还曾就职于美国国防部防御分析研究所以及INRIA。. Philippe Flajolet INRIA的高级研究主任，在Ecole Polytechnique和普林斯顿大学任教，并在斯坦福大学、智利大学和弗吉尼亚技术大学拥有访问席位。他还是法国科学院的通信会员。... .. << 查看详细 |
| chapter one: analysis of algorithms . 1.1 why analyze an algorithm? 1.2 computational complexity 1.3 analysis of algorithms 1.4 average-case analysis 1.5 example: analysis of ouicksort 1.6 asymptoticapproximations 1.7 distributions 1.8 probabilistic algorithms chapter two: recurrence relations 2.1 basic properties 2.2 first-order recurrences 2.3 nonlinear first-order recurrences 2.4 higher-order recurrences 2.5 methods for solving recurrences 2.6 binary divide-and-conquer recurrences and binary numbers 2.7 general divide-and-conquer recurrences chapter three:generating functions 3.1 ordinary generating functions 3.2 exponential generating functions .3.3 generating function solution of recurrences 3.4 expanding generating functions 3.5 transformations with generating functions 3.6 functional equations on generating functions 3.7 solving the quicksort median-of-three recurrence with ogfs 3.8 counting with generating functions 3.9 the symbolic method 3.10 lagrange inversion 3.11 probability generating functions 3.12 bivariate generating functions 3.13 special functions chapter four: asymptotic approximations 4.1 notation for asymptotic approximations 4.2 asymptotic expansions 4.3 manipulating asymptotic expansions 4.4 asymptotic approximations of finite sums .. 4.5 euler-maclaurin summation 4.6 bivariate asymptotics 4.7 laplace method 4.8 "normal" examples from the analysis of algorithms 4.9 "poisson" examples from the analysis of algorithms 4.10 generating function asymptotics chapter five: trees 5.1 binary trees 5.2 trees and forests 5.3 properties of trees 5.4 tree algorithms 5.5 binary search trees 5.6 average path length in catalan trees 5.7 path length in binary search trees 5.8 additive parameters of random trees 5.9 height 5.10 summary of average-case results on properties of trees 5.11 representations of trees and binary trees 5.12 unordered trees 5.13 labelled trees 5.14 other types of trees chapter six: permutations 6.1 basic properties of permutations 6.2 algorithms on permutations 6.3 representations of permutations 6.4 enumeration problems 6.5 analyzing properties of permutations with cgfs 6.6 inversions and insertion sorts 6.7 left-to-right minima and selection sort 6.8 cycles and in situ permutation 6.9 extremal parameters chapter seven: strings and tries 7.1 string searching 7.2 combinatorial properties of bitstrings 7.3 regular expressions 7.4 finite-state automata and the knuth-morris-pratt algorithm 7.5 context-free grammars 7.6 tries 7.7 trie algorithms 7.8 combinatorial properties of tries 7.9 larger alphabets chapter eight: words and maps 8.1 hashing with separate chaining 8.2 basic properties of words 8.3 birthday paradox and coupon collector problem 8.4 occupancy restrictions and extremal parameters 8.5 occupancy distributions 8.6 open addressing hashing 8.7 maps 8.8 integer factorization and maps list of theorems index ... |
内容加载中，请稍后...
商品评论（0条）