The Average case analysis of algorithms : complex asymptotics 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 : complex asymptotics 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 - complex asymptotics and generating functions - is devoted to the use of complex analysis in order to estimate the asymptotic growth of coefficients of combinatorial generating functions. It consists of two chapters : complex asymptotic methods - syngularity analysis of generating functions.

Domains

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

Dates and versions

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

Identifiers

  • HAL Id : inria-00074645 , version 1

Cite

Philippe Flajolet, Robert Sedgewick. The Average case analysis of algorithms : complex asymptotics and generating functions. [Research Report] RR-2026, INRIA. 1993. ⟨inria-00074645⟩
121 View
115 Download

Share

Gmail Facebook X LinkedIn More