Introduction to the Analysis of Algorithms, An (Hardback)
  • Introduction to the Analysis of Algorithms, An (Hardback)

Introduction to the Analysis of Algorithms, An (Hardback)

(author), (author)
Hardback 592 Pages / Published: 31/01/2013
  • Not available

This product is currently unavailable

This product is currently unavailable.

  • This item has been added to your basket
Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing primary techniques and results in the field. Robert Sedgewick and the late Philippe Flajolet have drawn from both classical mathematics and computer science, integrating discrete mathematics, elementary real analysis, combinatorics, algorithms, and data structures. They emphasize the mathematics needed to support scientific studies that can serve as the basis for predicting algorithm performance and for comparing different algorithms on the basis of performance. Techniques covered in the first half of the book include recurrences, generating functions, asymptotics, and analytic combinatorics. Structures studied in the second half of the book include permutations, trees, strings, tries, and mappings. Numerous examples are included throughout to illustrate applications to the analysis of algorithms that are playing a critical role in the evolution of our modern computational infrastructure. Improvements and additions in this new edition include Upgraded figures and code An all-new chapter introducing analytic combinatorics Simplified derivations via analytic combinatorics throughout The book's thorough, self-contained coverage will help readers appreciate the field's challenges, prepare them for advanced results-covered in their monograph Analytic Combinatorics and in Donald Knuth's The Art of Computer Programming books-and provide the background they need to keep abreast of new research. "[Sedgewick and Flajolet] are not only worldwide leaders of the field, they also are masters of exposition. I am sure that every serious computer scientist will find this book rewarding in many ways." -From the Foreword by Donald E. Knuth

Publisher: Pearson Education (US)
ISBN: 9780321905758
Number of pages: 592
Weight: 1134 g
Dimensions: 231 x 197 x 35 mm
Edition: 2nd edition

You may also be interested in...

Approximation Algorithms
Added to basket
Algorithmic Adventures
Added to basket
Added to basket
Introduction to Algorithms
Added to basket
Computational Geometry
Added to basket
Algorithms Unlocked
Added to basket
Understanding Cryptography
Added to basket
Automata and Computability
Added to basket
Machine Learning
Added to basket

Please sign in to write a review

Your review has been submitted successfully.