Mathematics for the analysis of algorithms
Author(s)
Bibliographic Information
Mathematics for the analysis of algorithms
（Progress in computer science and applied logic, v. 1）
Birkhäuser, c1990
3rd ed
- : us
- : sz
Available at / 31 libraries
-
Science and Technology Library, Kyushu University
007.64/G 82068252191001456,
: us068222191002645 -
Hokkaido University, Library, Graduate School of Science, Faculty of Science and School of Science図書
DC19:005.1/G8212070167274
-
No Libraries matched.
- Remove all filters.
Note
Bibliography: p. [77]-80
Includes index
Description and Table of Contents
Description
This monograph collects some fundamental mathematical techniques that are required for the analysis of algorithms. It builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is concise enough for easy reference yet detailed enough for those with little background with the material.
Table of Contents
Preface Binomial Identities.- Summary of Useful Identities.- Deriving the Identities.- Inverse Relations.- Operator Calculus.- Hypergeometric Series.- Identities with the Harmonic Numbers Recurrence Relations.- Linear Recurrence Relations.- Nonlinear Recurrence Relations Operator Methods.- The Cookie Monster.- Coalesced Hashing.- Open Addressing: Uniform Hashing.- Open Addressing: Secondary Clustering Asymptotic Analysis.- Basic Concepts.- Stieltjes Integration and Asymptotics.- Asymptotics from Generating Functions Bibliography Appendices.- Schedule of Lectures.- Homework Assignments.- Midterm Exam I and Solutions.- Final Exam I and Solutions.- Midterm Exam II and Solutions.- Final Exam II and Solutions.- Midterm Exam III and Solutions.- Final Exam III and Solutions.- A Qualifying Exam Problem and Solution Index
by "Nielsen BookData"