Overview

Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study.

Full Product Details

9780511801655

Table of Contents

Reviews

'... thorough and self-contained ... presentation of ... topics is very well organised ... provides an ample amount of examples and illustrations, as well as a comprehensive bibliography. It is valuable both as a reference work for researchers working in the field and as an accessible introduction suitable for students at an advanced graduate level.' EMS Newsletter

Author Information

Philippe Flajolet is Research Director of the Algorithms Project at INRIA Rocquencourt. Robert Sedgewick is William O. Baker Professor of Computer Science at Princeton University, New Jersey.

Tab Content 6

Customer Reviews

Recent Reviews

Countries Available