Wir bitten um Verständnis, dass es aufgrund der aktuellen Situation zu Verzögerungen bei der Auslieferung kommt.

Robert Sedgewick / Philippe Flajolet

Introduction to the Analysis of Algorithms, An

Edition 2

Introduction to the Analysis of Algorithms, An

Dieses Buch schon gelesen? Haben Sie dieses Buch gelesen?

Print-Ausgabe (das gedruckte Buch) Was ist das?

Best.Nr.
978-0-3219-0575-8
Umfang
592 Seiten
Erschienen am
18.01.2013
Sprache
Englisch
Lieferzeit
Innerhalb von 3 bis 5 Tagen
Versandkosten
Versandkostenfrei nach Deutschland und in die Schweiz
€ 71,39
x

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. Authors Robert Sedgewick and the late Philippe Flajolet 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. Improvements and additions in this new edition include upgraded figures and code, an all-new chapter introducing analytic combinatorics, and simplified derivations via analytic combinatorics throughout. The book’s thorough, self-contained coverage will help readers appreciate the field’s challenges and prepare them for advanced study.



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

Ihr Status: Sie sind nicht eingeloggt. Bitte loggen Sie sich ein um Zugang zu unseren Materialien zu bekommen.
Bitte beachten Sie, dass nicht bei allen Titeln Materialien zur Verfügung stehen.