Mathematics for the Analysis of Algorithms

Collects some fundamental mathematical techniques that are required for the analysis of algorithms
Very well written: the style and the mathematical exposition make the book pleasant to read
Covers a wide range of topics in an extremely concise manner, including many of the major paradigms used in the analysis of algorithms
Contains a wealth of highly original, instructive problems and solutions taken from actual examinations given at Stanford in various computer science courses
Presents a welcome selection and careful exposition of material that can be (and is) covered in a single course with a group of advanced students well-grounded in undergraduate mathematics and computer science
Details four important topics in algorithm analysis, all from a rudimentary, but highly original, point of view: each of these topics is critical to understanding the modern analysis of algorithms, primarily from the speed of execution perspective
A quantitative study of the efficiency of computer methods requires an in-depth understanding of both mathematics and computer science. This monograph, derived from an advanced computer science course at Stanford University, 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 terse enough for easy reference yet detailed enough for those with little background. Approximately half the book is devoted to original problems and solutions from examinations given at Stanford.