The contraction method for recursive algorithms
- 1 February 2001
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 29 (1) , 3-33
- https://doi.org/10.1007/bf02679611
Abstract
No abstract availableKeywords
This publication has 53 references indexed in Scilit:
- Modern Theory of Summation of Random VariablesPublished by Walter de Gruyter GmbH ,1997
- An L2 convergence theorem for random affine mappingsJournal of Applied Probability, 1995
- Stationarity of Garch processes and of some nonnegative time seriesJournal of Econometrics, 1992
- Random recursive construction of self-similar fractal measures. The noncompact caseProbability Theory and Related Fields, 1991
- The Distribution of a Perpetuity, with Applications to Risk Theory and Pension FundingScandinavian Actuarial Journal, 1990
- A note on the height of binary search treesJournal of the ACM, 1986
- A contraction principle for certain Markov chains and its applicationsPublished by American Mathematical Society (AMS) ,1986
- Branching ProcessesPublished by Springer Nature ,1983
- Some Asymptotic Theory for the BootstrapThe Annals of Statistics, 1981
- Branching ProcessesPublished by Springer Nature ,1972