The contraction method for recursive algorithms

Abstract

In this paper we give an introduction to the analysis of algorithms by the contraction method. By means of this method several interesting classes of recursions can be analyzed as particular cases of our general framework. We introduce the main steps of this technique which is based on contraction properties of the algorithm with respect to suitable probability metrics. Typically the limiting distribution is characterized as a fixed point of a limiting operator on the class of probability distributions. We explain this method in the context of several “divide and conquer” algorithms. In the second part of the paper we introduce a new quite general model for branching dynamical systems and explain that the contraction method can be applied in this model. This model includes many classical examples of random trees and gives a general frame for further applications.

DOI: 10.1007/BF02679611

Statistics

0510'00'02'04'06'08'10'12'14'16
Citations per Year

139 Citations

Semantic Scholar estimates that this publication has 139 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Rsler2001TheCM, title={The contraction method for recursive algorithms}, author={Uwe R{\"{o}sler and Ludger R{\"{u}schendorf}, journal={Algorithmica}, year={2001}, volume={29}, pages={3-33} }