## Find a copy in the library

Finding libraries that hold this item...

## Details

Document Type: | Book |
---|---|

All Authors / Contributors: |
Daniel H Greene; Donald Ervin Knuth |

ISBN: | 0817647287 9780817647285 |

OCLC Number: | 181090594 |

Notes: | "Reprint of the 1990 edition." "Originally published as volume 1 in the series Progress in computer science and applied logic"--Title page verso. |

Description: | viii, 132 pages : illustrations ; 24 cm. |

Contents: | 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 -- Finite History -- Constant Coefficients -- Variable Coefficients -- Full History -- Differencing -- By Repertoire -- Nonlinear Recurrence Relations -- Relations with Maximum or Minimum Functions -- Continued Fractions and Hidden Linear Recurrences -- Doubly Exponential Sequences -- Operator Methods -- The Cookie Monster -- Coalesced Hashing -- Open Addressing: Uniform Hashing -- Open Addressing: Secondary Clustering -- Asymptotic Analysis -- Basic Concepts -- Notation -- Bootstrapping -- Dissecting -- Limits of Limits -- Summary of Useful Asymptotic Expansions -- An Example from Factorization Theory -- Stieltjes Integration and Asymptotics -- O-notation and Integrals -- Euler's Summation Formula -- An Example from Number Theory -- Asymptotics from Generating Functions -- Darboux's Method -- Residue Calculus -- The Saddle Point Method. |

Series Title: | Modern Birkhäuser classics. |

Other Titles: | Progress in computer science and applied logic. |

Responsibility: | Daniel H. Greene, Donald E. Knuth. |

### Abstract:

## Reviews

*Editorial reviews*

Publisher Synopsis

"This is a short cookbook of methods for analyzing the run time of computer algorithms, aimed at computer scientists ... . a very erudite book, full of interesting things for both mathematicians and computer scientists ... ." (Allen Stenger, MAA Reviews, September, 2015)"Mathematics for the Analysis of Algorithms covers a variety of topics in a relatively small amount of pages. Despite its briefness, most of the topics are clearly and fully explained using detailed examples for better understanding. As such, the book is suitable for use as study material, as well as a good reference guide...The reviewer recommends this book to anyone interested in advanced theory of algorithms and the mathematics behind it, either as an exposition to the topic or as reference material in future work." -SIGACT NEWS"This book collects some fundamental mathematical techniques which are required for the analysis of algorithms... This book arose from handouts for an advanced course on the analysis of algorithms at Standard University, and the appendices list lectures, homework assignments and problems for the midterm and the final exams with their solutions. In summary, this book is a very valuable collection of mathematical techniques for the analysis of algorithms and accompanies, as well as complements, the second author's series The Art of Computer Programming." -Mathematical Reviews"The book covers the important mathematical tools used in computer science, especially in the exact analysis of algorithms. A wide range of topics are covered, from the binomial theorem to the saddle point method and Laplace's techniques for asymptotic analysis...The book is very well written. The style and the mathematical exposition make the book pleasant to read...It covers many of the major paradigms used in the analysis of algorithms in its one hundred plus pages." -SIAM Review"The book presents a welcome selection and careful exposition of material that can be (and is) covered in a single course...In this reviewer's opinion, this would be an interesting text to use with a group of advanced students well-grounded in undergraduate mathematics and computer science, and would produce a valuable course for the participating students." - Computing Reviews"The reader has probably heard of the expression 'good things come in small packages.' The validity of that maxim is no more in evidence than in the work under review, which is nothing less than a mathematical wellspring among the otherwise parched world of theoretical algorithm analysis. In only 76 pages (not counting the bibliography and amazing appendices), the authors cover four important topics in algorithm analysis, all from a rudimentary, but highly original, point of view: Binomial Identities, Recurrence Relations, Operator Methods, and Asymptotic Analysis. Each of these topics is critical to understanding the modern analysis of algorithms, primarily from the speed of execution perspective... In summary, the book under review should not be underestimated in its powerful use of mathematics for the analysis of algorithms arising from computer science considerations." -Timothy Hall, Process Quality Improvement Consulting"The analysis of algorthms is possible on mathematical and on computer scientific ways. This [book] is a mathematical look at this topic. It is based on an advanced course in computer science at Stanford University... The Appendices contain further difficult problems for applying the methods of this outstanding, full-of-thoughts book." -P.L. Erdos (Periodica Mathematica Hungarica) Read more...

*User-contributed reviews*