The Average Case Analysis of Algorithms : Multivariate Asymptotics and Limit Distributions

Philippe Flajolet 1 Robert Sedgewick
1 ALGO - Algorithms
Inria Paris-Rocquencourt
Abstract : This report is part of a series whose aim is to present in a synthetic way the major methods of «analytic combinatorics» needed in the average--case analysis of algorithms. It develops a general approach to the distributional analysis of parameters of elementary combinatorial structures like strings, trees, graphs, permutations, and so on. The methods are essentially analytic and relie on multivariate generating functions, singularity analysis, and continuity theorems. The limit laws that are derived mostly belong to the Gaussian, Poisson, or geometric type.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00073527
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 1:07:29 PM
Last modification on : Friday, May 25, 2018 - 12:02:02 PM
Long-term archiving on : Monday, September 17, 2012 - 2:40:35 PM

Identifiers

  • HAL Id : inria-00073527, version 1

Collections

Citation

Philippe Flajolet, Robert Sedgewick. The Average Case Analysis of Algorithms : Multivariate Asymptotics and Limit Distributions. [Research Report] RR-3162, INRIA. 1997. ⟨inria-00073527⟩

Share

Metrics

Record views

120

Files downloads

133