[内容简介]

Despite the large interest in the mathematical analysis of algorithms, basic information on methods and models in widespread use has not been directly accessible for work or study in the field. The authors here address this need, combining a body of material that gives the reader both an appreciation for the challenges of the field and the requisite background for keeping abreast of the new research being done to meet these challenges. Highlights: Thorough, self-contained coverage for students and professionals in computer science and mathematics Focus on mathematical techniques of analysis Basic preparation for the advanced results covered in Knuth's books and the research literature Classical approaches and results in the analysis of algorithms

A thorough overview of the primary techniques and models used in the mathematical analysis of algorithms. This book draws upon classical mathematical material from discrete mathematics, elementary real analysis, and combinations and discusses properties of discrete structures and covers the analysis of a variety of classic forting, searching, and string processing algorithms.

[目录]

Ch. 1

Analysis of Algorithms

Ch. 2

Recurrence Relations

Ch. 3

Generating Functions

Ch. 4

Asymptotic Approximations

Ch. 5

Trees

Ch. 6

Permutations

Ch. 7

Strings and Tries

Ch. 8

Words and Maps

          List of Theorems
          Index