# 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.
Document type :
Reports
Domain :

https://hal.inria.fr/inria-00074300
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 3:00:34 PM
Last modification on : Friday, May 25, 2018 - 12:02:02 PM
Long-term archiving on: : Tuesday, April 12, 2011 - 4:26:34 PM

### Identifiers

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

Record views