# The average case analysis of algorithms : Saddle Point Asymptotics

1 ALGO - Algorithms
Inria Paris-Rocquencourt
Abstract : This report is part of a series whose aim is to present in a synthetic way the major methods of analytic combinatorics'' needed in the average--case analysis of algorithms. It reviews the use of the saddle point method in order to estimate asymptotically coefficients of fast growing generating functions. The applications treated concern the enumeration of set partitions and integer partitions, permutations with cycle restrictions, increasing subsequences, as well as distribution estimates when large powers are involved.
Type de document :
Rapport
[Research Report] RR-2376, INRIA. 1994
Domaine :

https://hal.inria.fr/inria-00074300
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 15:00:34
Dernière modification le : vendredi 25 mai 2018 - 12:02:02
Document(s) archivé(s) le : mardi 12 avril 2011 - 16:26:34

### Identifiants

• HAL Id : inria-00074300, version 1

### Citation

Philippe Flajolet, Robert Sedgewick. The average case analysis of algorithms : Saddle Point Asymptotics. [Research Report] RR-2376, INRIA. 1994. 〈inria-00074300〉

### Métriques

Consultations de la notice

## 112

Téléchargements de fichiers