Cargando…

An introduction to the analysis of algorithms

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 introd...

Descripción completa

Detalles Bibliográficos
Autores principales: Sedgewick, Robert, Flajolet, Philippe
Lenguaje:eng
Publicado: Addison-Wesley 2013
Materias:
Acceso en línea:http://cds.cern.ch/record/1555050
_version_ 1780930384178970624
author Sedgewick, Robert
Flajolet, Philippe
author_facet Sedgewick, Robert
Flajolet, Philippe
author_sort Sedgewick, Robert
collection CERN
description 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.
id cern-1555050
institution Organización Europea para la Investigación Nuclear
language eng
publishDate 2013
publisher Addison-Wesley
record_format invenio
spelling cern-15550502021-04-21T22:39:19Zhttp://cds.cern.ch/record/1555050engSedgewick, RobertFlajolet, PhilippeAn introduction to the analysis of algorithmsComputing and ComputersDespite 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.Addison-Wesleyoai:cds.cern.ch:15550502013
spellingShingle Computing and Computers
Sedgewick, Robert
Flajolet, Philippe
An introduction to the analysis of algorithms
title An introduction to the analysis of algorithms
title_full An introduction to the analysis of algorithms
title_fullStr An introduction to the analysis of algorithms
title_full_unstemmed An introduction to the analysis of algorithms
title_short An introduction to the analysis of algorithms
title_sort introduction to the analysis of algorithms
topic Computing and Computers
url http://cds.cern.ch/record/1555050
work_keys_str_mv AT sedgewickrobert anintroductiontotheanalysisofalgorithms
AT flajoletphilippe anintroductiontotheanalysisofalgorithms
AT sedgewickrobert introductiontotheanalysisofalgorithms
AT flajoletphilippe introductiontotheanalysisofalgorithms