The Average Case Analysis Of Algorithms - Saddle Point Asymptotics (1994)
| Venue: | INRIA Rpt |
| Citations: | 7 - 1 self |
BibTeX
@ARTICLE{Flajolet94theaverage,
author = {Philippe Flajolet and Rocquencourt Princeton and Robert Sedgewick and Robert Sedgewick},
title = {The Average Case Analysis Of Algorithms - Saddle Point Asymptotics},
journal = {INRIA Rpt},
year = {1994},
volume = {2376},
number = {2376},
pages = {pages.}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. The series should comprise the following chapters; 1. Symbolic Enumeration and Ordinary Generating Functions; 2. Labelled Structures and Exponential Generating Functions; 3. Parameters and Multivariate Generating Functions; 4. Complex Asymptotic Methods; 5. Singularity Analysis of Generating Functions; 6. Saddle Point Asymptotics; 7. Mellin Transform Asymptotics; 8. Functional Equations and Generating Functions; 9. Multivariate Asymptotics and Combinatorial Distributions. Chapters 1--3 have been issued as INRIA Research Report 1888 ("The Average Case Analysis of Algorithms: Counting and Generating Functions", 116 pages, 1993). Chapters 4--5 as INRIA Research Report 2026 ("The Average Case Analysis of Algorithms: Complex Asymptotics and Generating Functions", 100 pages, 1993). The present report corresponds to Chapter 6 of the series.
