PHILIPPE FLAJOLET's BOOKS
This is a book by Flajolet and
Sedgewick that has appeared
in January 2009, published by
Cambridge University Press:
the dedicated book page for details, contents, errata, and availability.
We'll be glad to hear from you for technical
comments, if you find major errors, and also if you're using this for
teaching or research.
ANALYTIC COMBINATORICS (free download link).
810p.+xiv. Electronic edition of June 26, 2009
(identical to the print version).
proposes a unified treatment of analytic methods in
We develop in
about 800 pages the basics of
asymptotic enumeration and the analysis of random combinatorial structures
through an approach that revolves around
generating functions and complex analysis.
A symbolic framework (Chapters I-III) first provides systematically
a large number of exact description of combinatorial models
in terms of generating functions.
Major properties of generating functions
that are of interest in this book are singularities.
The text then presents (in Chapters IV-VIII) the core of
the theory with two chapters on complex analytic methods
focusing on rational and meromorphic functions as well as
two chapters on fundamentals of singularity analysis and
combinatorial consequences, followed by a chapter on the
saddle point method. The last section (Chapters IX)
asymptotics and limit laws in random structures.
Many examples are given that
relate to words, integer compositions and partitions, paths and walks,
graphs, mappings and allocations, lattice paths, permutations, trees,
and planar maps.
An Introduction to the Analysis
of Algorithms by
Sedgewick and Flajolet
is published by
Addison Wesley (1996) and it has 512 pages
Introduction a l'analyse des
Sedgewick and Flajolet.
This French translation of the English original by Cyril Chabaud
is published by
International Thomson Publishing France (1996) and it has
There is also an authorized Chinese edition, dated 2006.
Books edited (or co-edited)
Mathematics and Computer Science III:
Algorithms, Trees, Combinatorics and Probabilities.
Series: Trends in Mathematics (Mathematics, Computer Science).
Drmota, M.; Flajolet, P.; Gardy, D.; Gittenberger, B.
2004, XV, 554 p., Hardcover
A Birkhäuser book.
"This book contains invited and contributed papers on combinatorics,
random graphs and networks, algorithms analysis and
trees, branching processes, constituting the Proceedings
of the 3rd International Colloquium on Mathematics and
Computer Science that held in Vienna in
September 2004. It addresses a large public in applied
mathematics, discrete mathematics and computer science,
including researchers, teachers, graduate students and
engineers. They will find here current questions in
Computer Science and the related modern and powerful
mathematical methods. The range of applications is very
wide and goes beyond Computer Science."
Mathematics and Computer Science II: Algorithms, Trees, Combinatorics and
Probabilities. Brigitte, Chauvin, Philippe Flajolet,
Danièle Gardy, A. Mokkadem
ISBN 3-7643-6933-7 (Published by Birkhäuser Verlag, Basel,
2002. Series: Trends in Mathematics. 560 pages. Hardcover).
This represents the Proceedings of theColloquium held in Versailles,
September 2002 under the same name
as the book.
"This is the second volume in a series of innovative proceedings entirely
devoted to the connections between
mathematics and computer science.
Here mathematics and computer
science are directly confronted and
joined to tackle intricate problems
in computer science with deep and
The book serves as an outstanding
tool and a main information
source for a large public in applied
mathematics and computer
science, including researchers,
teachers, graduate students and
engineers. It provides an overview
of the current questions in
computer science and the related
modern and powerful
mathematical methods. The
range of applications is very wide
and reaches beyond computer
Return to Philippe Flajolet's Home Page