The Average case analysis of algorithms : complex asymptotics 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 - 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.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00074645
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 3:59:08 PM
Last modification on : Friday, May 25, 2018 - 12:02:02 PM
Long-term archiving on : Tuesday, April 12, 2011 - 5:59:07 PM

Identifiers

  • HAL Id : inria-00074645, version 1

Collections

Citation

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

Share

Metrics

Record views

152

Files downloads

99