The Average case analysis of algorithms : counting and generating functions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1993

The Average case analysis of algorithms : counting and generating functions

Philippe Flajolet
  • Function : Author
  • PersonId : 829512
Robert Sedgewick
  • Function : Author

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1888.pdf (3.35 Mo) Télécharger le fichier

Dates and versions

inria-00074784 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074784 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More