The Average case analysis of algorithms : counting and generating functions

Philippe Flajolet 1 Robert Sedgewick
1 ALGO - Algorithms
Inria Paris-Rocquencourt
Abstract : This report is part of a projected series whose aim is to present in a synthetic way the major methods and models in the average-case analysis of algorithms. The present work (counting and generating functions) introduces a symbolic approach through formal specifications to the analysis of basic combinatorial structures. It consists of three chapters : symbolic enumeration and ordinary generating functions - labelled structures and exponential generating functions - parameters and multivariate generating functions.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00074784
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 4:19:36 PM
Last modification on : Friday, May 25, 2018 - 12:02:02 PM
Long-term archiving on : Tuesday, April 12, 2011 - 3:53:45 PM

Identifiers

  • HAL Id : inria-00074784, version 1

Collections

Citation

Philippe Flajolet, Robert Sedgewick. The Average case analysis of algorithms : counting and generating functions. [Research Report] RR-1888, INRIA. 1993. ⟨inria-00074784⟩

Share

Metrics

Record views

202

Files downloads

133