Divide-and-Conquer Recurrences, Functional Equations and Their Asymptotic Analysis
by
Gregory Derfel
,
Fritz Vogl
BibTeX
@MISC{Derfel_divide-and-conquerrecurrences,,
author = {Gregory Derfel and Fritz Vogl},
title = {Divide-and-Conquer Recurrences, Functional Equations and Their Asymptotic Analysis},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Introduction and formulation of main results There are several important problems, stemming from the theory of algorithms, probability theory etc., leading to the study of the asymptotic behaviour of the sequence ff n g defined by means of the recurrence relation [2 n \Gamma (a 1 + a 0 )]f n = a 1 n\Gamma1 X k=0 ` n k ' ff n\Gammak f k + b 1 fi n ; n ? l; (1.1) supplemented by given initial values f 0 ; f 1 ; : : : ; f l : (1.2) Here ff; fi ? 0, a 0 ; a 1 ; b 1 2 R are given parameters. Suppose a
Citations
| 275 | Odlyzko A. Singularity analysis of generating functions - Flajolet |
| 18 | Generalized digital trees and their difference-differential equations, Random Structures Algorithms - Flajolet, Richmond - 1992 |
| 18 | On some applications of formulae of Ramanujan in the analysis of algorithms - Kirschenhofer, Prodinger - 1991 |
| 14 | On the linear ordinary q-difference equation - Adams |
| 4 | Moments of order statistics of the Cantor distribution - Hosking - 1994 |
| 4 | Explicit and asymptotic formulae for the expected values of the order statistics of the Cantor distribution - Knopfmacher, Prodinger - 1996 |
| 2 | Analytical Depoissonisation and its application, Theoretical Computer Science - Jacquet, Szpankowski - 1997 |
| 1 | On properties of linear q-difference equations with entire function coefficients - Mason - 1915 |
| 1 | How to select a loser, Disc.Math - Prodinger - 1993 |
