Analytic combinatorics: a calculus of discrete structures

Authors:
Philippe Flajolet
Affiliations:
Algorithms Project, INRIA-Rocquencourt, Le Chesnay, France
Venue:
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2007

Citing 30
Cited 0

Branching processes in the analysis of the heights of trees

Acta Informatica
Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels

IEEE Transactions on Information Theory
Analytic models and ambiguity of context-free languages

Theoretical Computer Science
Generating functionology

Generating functionology
Symmetric functions and P-Recursiveness

Journal of Combinatorial Theory Series A
A holonomic systems approach to special functions identities

Journal of Computational and Applied Mathematics
Automatic average-case analysis of algorithms

Theoretical Computer Science - Theme issue on the algebraic and computing treatment of noncommutative power series
Average-case analysis of algorithms and data structures

Handbook of theoretical computer science (vol. A)
A calculus for the random generation of labelled combinatorial structures

Theoretical Computer Science
Mellin transforms and asymptotics

Acta Informatica
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees

Theoretical Computer Science - Special volume on mathematical analysis of algorithms (dedicated to D. E. Knuth)
Randomized algorithms

Randomized algorithms
An introduction to the analysis of algorithms

An introduction to the analysis of algorithms
Analysis of algorithms: computational methods and mathematical tools

Analysis of algorithms: computational methods and mathematical tools
Asymptotic enumeration methods

Handbook of combinatorics (vol. 2)
Systems of functional equations

Random Structures & Algorithms - Special issue: average-case analysis of algorithms
On convergence rates in the central limit theorems for combinatorial structures

European Journal of Combinatorics
Random sampling of large planar maps and convex polyhedra

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Modern computer algebra

Modern computer algebra
Fast algorithms for sorting and searching strings

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The complete analysis of a polynomial factorization algorithm over finite fields

Journal of Algorithms
Average Case Analysis of Algorithms on Sequences

Average Case Analysis of Algorithms on Sequences
Introductory Combinatorics

Introductory Combinatorics
Motif statistics

Theoretical Computer Science
Relax, but don't be too lazy

Journal of Symbolic Computation
The number of bit comparisons used by Quicksort: an average-case analysis

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Boltzmann Samplers for the Random Generation of Combinatorial Structures

Combinatorics, Probability and Computing
Singularity analysis, Hadamard products, and tree recurrences

Journal of Computational and Applied Mathematics
Hidden word statistics

Journal of the ACM (JACM)
On the average redundancy rate of the Lempel-Ziv code

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The efficiency of many discrete algorithms crucially depends on quantifying properties of large structured combinatorial configurations. We survey methods of analytic combinatorics that are simply based on the idea of associating numbers to atomic elements that compose combinatorial structures, then examining the geometry of the resulting functions. In this way, an operational calculus of discrete structures emerges. Applications to basic algorithms, data structures, and the theory of random discrete structures are outlined.