Buy Used
Buy Used from BN.com
$42.40
Used and New from Other Sellers
Used and New from Other Sellers
from $8.71
Usually ships in 12 business days
(Save 86%)
Other sellers (Paperback)

All (16)
from
$8.71

New (5)
from
$24.38

Used (11)
from
$8.71
Note: Marketplace items are not eligible for any BN.com coupons and promotions
020140009X Some Shelf Wear Brand New! Fast Shipping! Free USPS Tracking Number. Excellent Customer Service!
Ships from: Lexington, KY
Usually ships in 12 business days
 •Standard, 48 States
 •Standard (AK, HI)
 •Express, 48 States
 •Express (AK, HI)
Brand New Text!!! Never Been Used!!! This text is totally clean with no writing at all!!!
Ships from: Knoxville, TN
Usually ships in 12 business days
 •Standard, 48 States
 •Standard (AK, HI)
 •Express, 48 States
 •Express (AK, HI)
Brand New, Perfect Condition, Please allow 414 business days for delivery. 100% Money Back Guarantee, Over 1,000,000 customers served.
Ships from: Westminster, MD
Usually ships in 12 business days
 •Canadian
 •International
 •Standard, 48 States
 •Standard (AK, HI)
BRAND NEW
Ships from: Avenel, NJ
Usually ships in 12 business days
 •Canadian
 •International
 •Standard, 48 States
 •Standard (AK, HI)
New
Ships from: Idyllwild, CA
Usually ships in 12 business days
 •Canadian
 •International
 •Standard, 48 States
 •Standard (AK, HI)
 •Express, 48 States
 •Express (AK, HI)
More About This Textbook
Overview
This book provides a thorough introduction to the primary techniques used in the mathematical analysis of algorithms. The authors draw from classical mathematical material, including discrete mathematics, elementary real analysis, and combinatorics, as well as from classical computer science material, including algorithms and data structures. They focus on "averagecase" or "probabilistic" analysis, although they also cover the basic mathematical tools required for "worstcase" or "complexity" analysis. Topics include recurrences, generating functions, asymptotics, trees, strings, maps, and an analysis of sorting, tree search, string search, and hashing algorithms.
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:
020140009XB04062001
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.
Editorial Reviews
D. E. Knuth
People who analyze algorithms have double happiness. First of all they experience the sheer beauty of elegant mathematical patterns that surround elegant computational procedures. Then they receive a practical payoff when their theories make it possible to get other jobsdone more quickly and more economically.... The appearance of this longawaited [book] is therefore most welcome. Its authors are not only worldwide leaders of the field, they also are masters of exposition.Booknews
An introduction to the primary techniques used in the mathematical analysis of algorithms, intended as a textbook in an upperlevel course on mathematical analysis of algorithms or for a course in discrete mathematics for computer scientists. Material is drawn from discrete mathematics, elementary real analysis, and combinatorics, as well as algorithms and data structures. Annotation c. Book News, Inc., Portland, OR (booknews.com)Product Details
Related Subjects
Meet the Author
Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, IDA, and INRIA. He earned his Ph.D from Stanford University under Donald E. Knuth.
About Philippe Flajolet The late Philippe Flajolet was a Senior Research Director at INRIA, Rocquencourt, where he created and led the ALGO research group, attracting visiting researchers from all over the world. He is celebrated for having opened new lines of research in the analysis of algorithms, having developed powerful new methods, and having solved difficult, open problems. Dr. Flajolet taught at Ecole Polytechnique and Princeton University; he also held visiting positions at Waterloo University, Stanford University, the University of Chile, the Technical University of Vienna, IBM, and Bell Laboratories. He received several prizes, including the Grand Science Prize of UAP (1986), the Computer Science Prize of the French Academy of Sciences (1994), and the Silver Medal of CNRS (2004). He was elected a Member of the Academia Europaea in 1995 and a Member (Fellow) of the French Academy of Sciences in 2003.
Phillipe passed away suddenly and unexpectedly a few months ago.
Read an Excerpt
This book is intended to be a thorough overview of the primary techniques used in the mathematical analysis of algorithms. The material covered draws from classical mathematical topics, including discrete mathematics, elementary real analysis, and combinatorics; as well as from classical computer science topics, including algorithms and data structures. The focus is on "averagecase'' or "probabilistic'' analysis, though the basic mathematical tools required for "worstcase" or "complexity" analysis are covered, as well.
It is assumed that the reader has some familiarity with basic concepts in both computer science and real analysis. In a nutshell, the reader should be able to both write programs and prove theorems; otherwise, the book is intended to be selfcontained. Ample references to preparatory material in the literature are also provided. A planned companion volume will cover more advanced techniques. Together, the books are intended to cover the main techniques and to provide access to the growing research literature on the analysis of algorithms.
The book is meant to be used as a textbook in a junior or seniorlevel course on "Mathematical Analysis of Algorithms.'' It might also be useful in a course in discrete mathematics for computer scientists, since it covers basic techniques in discrete mathematics as well as combinatorics and basic properties of important discrete structures within a familiar context for computer science students. It is traditional to have somewhat broader coverage in such courses, but many instructors may find the approach here a useful way to engage students in a substantial portion of the material. The book also can be used to introduce students in mathematics and applied mathematics to principles from computer science related to algorithms and data structures.
Supplemented by papers from the literature, the book can serve as the basis for an introductory graduate course on the analysis of algorithms, or as a reference or basis for selfstudy by researchers in mathematics or computer science who want access to the literature in this field. It also might be of use to students and researchers in combinatorics and discrete mathematics, as a source of applications and techniques.
Despite the large literature on the mathematical analysis of algorithms, basic information on methods and models in widespread use has not been directly accessible to students and researchers in the field. This book aims to address this situation, bringing together a body of material intended to provide the reader with both an appreciation for the challenges of the field and the requisite background for learning the advanced tools being developed to meet these challenges.
Preparation
Mathematical maturity equivalent to one or two years' study at the college level is assumed. Basic courses in combinatorics and discrete mathematics may provide useful background (and may overlap with some material in the book), as would courses in real analysis, numerical methods, or elementary number theory. We draw on all of these areas, but summarize the necessary material here, with reference to standard texts for people who want more information.
Programming experience equivalent to one or two semesters' study at the college level, including elementary data structures, is assumed. We do not dwell on programming and implementation issues, but algorithms and data structures are the central object of our studies. Again, our treatment is complete in the sense that we summarize basic information, with reference to standard texts and primary sources.
Access to a computer system for mathematical manipulation such as MAPLE or Mathematica is highly recommended. These systems can relieve one from tedious calculations, when checking material in the text or solving exercises.
Related books
Related texts include "The Art of Computer Programming" by Knuth; "Handbook of Algorithms and Data Structure" by Gonnet and BaezaYates; "Algorithms"by Sedgewick; "Concrete Mathematics" by Graham, Knuth and Patashnik; and "Introduction to Algorithms" by Cormen, Leiserson, and Rivest. This book could be considered supplementary to each of these, as examined below, in turn.
In spirit, this book is closest to the pioneering books by Knuth, but our focus is on mathematical techniques of analysis, where those books are broad and encyclopaedic in scope with properties of algorithms playing a primary role and methods of analysis a secondary role. This book can serve as basic preparation for the advanced results covered and referred to in Knuth's books.
We also cover approaches and results in the analysis of algorithms that have been developed sincepublication of Knuth's books. The book by Gonnet and BaezaYates is a thorough survey of such results, including a comprehensive bibliography. That book primarily presents results with reference to derivations in the literature. Again, this book provides the basic preparation for access to this literature.
We also strive to keep the focus on covering algorithms of fundamental importance and interest, such as those described in Sedgewick, where Graham, Knuth, and Patashnik focus almost entirely on mathematical techniques. This book is intended to bea link between the basic mathematical techniques discussed in Knuth, Graham, and Patashnik and the basic algorithms covered in Sedgewick.
The book by Cormen, Leiserson, and Rivest is representative of a number of books that provide access to the research literature on "design and analysis'' of algorithms, which is normally based on rough worstcase estimates of performance. When more precise results are desired (presumably for the most important methods), more sophisticated models and mathematical tools are required. This book is supplementary to books like Cormen, Leiserson and Rivest in that they focus on design of algorithms (usually with the goal of bounding worstcase performance), with analytic results used to help guide the design, where we focus on the analysis of algorithms, especially on techniques that can be used to develop detailed results that could be used to predict performance. In this process, we also consider relationships to various classical mathematical tools. Chapter 1 is devoted entirely to developing this context.
This book also lays the groundwork for a companion volume, "Analytic Combinatorics", a general treatment that places the material in this book into a broader perspective and develops advanced methods and models that can serveas the basis for new research, not only in averagecase analysis of algorithms, but also in combinatorics. A higher level of mathematical maturity is assumed for that volume, perhaps at the senior or beginning graduate student level. Of course, careful study of this book is adequate preparation. It certainly has been our goal to make the present volume sufficiently interesting that some readers will be inspired to tackle more advanced material!
How to use this book
Readers of this book are likely to have rather diverse backgrounds in discrete mathematics and computer science. With this in mind, it is useful to be aware the basic structure of book: There are eight chapters, an introduction followed by three chapters that emphasize mathematical methods, then four chapters that emphasize applications in the analysis of algorithms, as shown in the following outline:
Chapter 1 puts the material in the book into perspective, and will help all readers understand the basic objectives of the book and the role of the remaining chapters in meeting those objectives. Chapters 24 are more oriented towards mathematics, as they cover methods from discrete mathematics, primarily focused on developing basic concepts and techniques. Chapters 58 are more oriented towards computer science, as they cover properties of combinatorial structures, their relationships to fundamental algorithms, and analytic results.
Though the book is intended to be selfcontained, differences in emphasis are appropriate in teaching the material, depending on the background and experience of students and instructor. One approach, more mathematically oriented, would be to emphasize the theorems and proofs in the first part of the book, with applications drawn from Chapters 58. Another approach, more oriented towards computer science, would be to briefly cover the major mathematical tools in Chapters 24 and emphasize the algorithmic material in the second half of the book. But our primary intention is that most students should be able to learn new material from both mathematics and computer science in an interesting context by working carefully all the way through the book.
Students with a strong computer science background are likely to have seen many of the algorithms and data structures from the second half of the book but not much of the mathematical material at the beginning; students with a strong background in mathematics are likely to find the mathematical material familiar but perhaps not the algorithms and data structures. A course covering all of the material in the book could help either group of students fill in gaps in their background while building upon knowledge they already have.
There are several hundred exercises, and a list of references at the end of each chapter is included to encourage readers to consider the material in the text in more depth and to examine original sources. Further, our experience in teaching this material has shown that there are numerous opportunities for instructors to supplement lecture and reading material with computationbased laboratories and homework assignments. The material covered here is an ideal framework for students to develop expertise in a symbolic manipulation system such as Mathematica or MAPLE. Also, the experience of validating the mathematical studies by comparing them against empirical studies can be very valuable for many students.
Table of Contents
1. Analysis of Algorithms.
Why Analyze an Algorithm?
Computational Complexity.
Analysis of Algorithms.
AverageCase Analysis.
Example: Analysis of Quicksort.
Asymptotic Approximations.
Distributions.
Probabilistic Algorithms.
2. Recurrence Relations.
Basic Properties.
FirstOrder Recurrences.
Nonlinear FirstOrder Recurrences.
HigherOrder Recurrences.
Methods for Solving Recurrences.
Binary DivideandConquer Recurrences and Binary Numbers.
General DivideandConquer Recurrences.
3. Generating Functions.
Ordinary Generating Functions.
Exponential Generating Functions.
Generating Function Solution of Recurrences.
Expanding Generating Functions.
Transformations with Generating Functions.
Functional Equations on Generating Functions.
Solving the Quicksort MedianofThree.
Recurrence with OGFs.
Counting with Generating Functions.
The Symbolic Method.
Lagrange Inversion.
Probability Generating Functions.
Bivariate Generating Functions.
Special Functions.
4. Asymptotic Approximations.
Notation for Asymptotic Approximations.
Asymptotic Expansions.
Manipulating Asymptotic Expansions.
Asymptotic Approximations of Finite Sums.
EulerMaclaurin Summation.
Bivariate Asymptotics.
Laplace Method.
“Normal” Examples from the Analysis of Algorithms.
“Poisson” Examples from the Analysis of Algorithms.
Generating Function Asymptotics.
5. Trees.
Binary Trees.
Trees and Forests.
Properties of Trees.
Tree Algorithms.
Binary Search Trees.
Average Path Length in Catalan Trees.
Path Length in Binary Search Trees.
Additive Parameters of Random Trees.
Height.
Summary of AverageCase Results on Properties of Trees.
Representations of Trees and Binary Trees.
Unordered Trees.
Labelled Trees.
Other Types of Trees.
6. Permutations.
Basic Properties of Permutations.
Algorithms on Permutations.
Representations of Permutations.
Enumeration Problems.
Analyzing Properties of Permutations with CGFs.
Inversions and Insertion Sorts.
LefttoRight Minima and Selection Sort.
Cycles and In Situ Permutation.
Extremal Parameters.
7. Strings and Tries.
String Searching.
Combinatorial Properties of Bitstrings.
Regular Expressions.
FiniteState Automata and KnuthMorrisPratt Algorithm.
ContextFree Grammars.
Tries.
Trie Algorithms.
Combinatorial Properties of Tries.
Larger alphabets.
8. Words and Maps.
Hashing with Separate Chaining.
Basic Properties of Words.
Birthday Paradox and Coupon Collector Problem.
Occupancy Restrictions and Extremal Parameters.
Occupancy Distributions.
Open Addressing Hashing.
Maps.
Integer Factorization and Maps. 020140009XT04062001
Preface
Preparation
Related books
How to use this book
020140009XP04062001