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.
Type de document :
Rapport
[Research Report] RR-2026, INRIA. 1993
Liste complète des métadonnées

https://hal.inria.fr/inria-00074645
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 15:59:08
Dernière modification le : mardi 17 avril 2018 - 11:28:41
Document(s) archivé(s) le : mardi 12 avril 2011 - 17:59:07

Fichiers

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

137

Téléchargements de fichiers

81