Divide-and-conquer recurrences - Classification of asymptotics

Gregory Derfel; Fritz Vogl

doi:10.1007/PL00000132

Divide-and-conquer recurrences - Classification of asymptotics

Gregory Derfel, Fritz Vogl

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

We deal with a class of recurrence equations arising in the theory of algorithms, stochastic pocesses, computer science, etc. and give a classification theorem for asymptotics of their solutions. The method of the proof is based upon consideration of the exponential generating function, which is a solution of a linear nonhomogeneous functional equation with rescaling.

Original language	English
Pages (from-to)	243-257
Number of pages	15
Journal	Aequationes Mathematicae
Volume	60
Issue number	3
DOIs	https://doi.org/10.1007/PL00000132
State	Published - 1 Jan 2000

ASJC Scopus subject areas

General Mathematics
Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1007/PL00000132

Cite this

@article{f5dd74e9fee5429eb462f888870e70a4,

title = "Divide-and-conquer recurrences - Classification of asymptotics",

abstract = "We deal with a class of recurrence equations arising in the theory of algorithms, stochastic pocesses, computer science, etc. and give a classification theorem for asymptotics of their solutions. The method of the proof is based upon consideration of the exponential generating function, which is a solution of a linear nonhomogeneous functional equation with rescaling.",

author = "Gregory Derfel and Fritz Vogl",

note = "Funding Information: Partially supported by a grant from Israeli Academy of Science and Humanities yPartially supported by the Austrian Science Foundation project P12176{MAT",

year = "2000",

month = jan,

day = "1",

doi = "10.1007/PL00000132",

language = "English",

volume = "60",

pages = "243--257",

journal = "Aequationes Mathematicae",

issn = "0001-9054",

publisher = "Birkhauser Verlag Basel",

number = "3",

}

TY - JOUR

T1 - Divide-and-conquer recurrences - Classification of asymptotics

AU - Derfel, Gregory

AU - Vogl, Fritz

N1 - Funding Information: Partially supported by a grant from Israeli Academy of Science and Humanities yPartially supported by the Austrian Science Foundation project P12176{MAT

PY - 2000/1/1

Y1 - 2000/1/1

N2 - We deal with a class of recurrence equations arising in the theory of algorithms, stochastic pocesses, computer science, etc. and give a classification theorem for asymptotics of their solutions. The method of the proof is based upon consideration of the exponential generating function, which is a solution of a linear nonhomogeneous functional equation with rescaling.

AB - We deal with a class of recurrence equations arising in the theory of algorithms, stochastic pocesses, computer science, etc. and give a classification theorem for asymptotics of their solutions. The method of the proof is based upon consideration of the exponential generating function, which is a solution of a linear nonhomogeneous functional equation with rescaling.

UR - http://www.scopus.com/inward/record.url?scp=52849131573&partnerID=8YFLogxK

U2 - 10.1007/PL00000132

DO - 10.1007/PL00000132

M3 - Article

AN - SCOPUS:52849131573

SN - 0001-9054

VL - 60

SP - 243

EP - 257

JO - Aequationes Mathematicae

JF - Aequationes Mathematicae

IS - 3

ER -

Divide-and-conquer recurrences - Classification of asymptotics

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this