Analysis of algorithms by the contraction method: additive and max-recursive sequences

MaRDI QIDQ5718849zbMATH OpenFDO

Authors Ralph Neininger, Ludger Rüschendorf

Publication date 16 January 2006

zbMATH Keywords

limit law for maximaprobability metric

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Recommendations

• The contraction method for recursive algorithms
• scientific article; zbMATH DE number 939772
• scientific article; zbMATH DE number 1392847
• On stochastic recursive equations of sum and max type
• A survey of multivariate aspects of the contraction method

Cited in

(18)

• A general limit theorem for recursive algorithms and combinatorial structures
• The contraction method for recursive algorithms
• Fixed points of the smoothing transform: two-sided solutions
• Weighted branching and a pathwise renewal equation
• Thin tails of fixed points of the nonhomogeneous smoothing transform
• The smoothing transform: a review of contraction results
• Asymptotic behaviour of moments of random recursive sequences
• The weighted branching process
• scientific article; zbMATH DE number 939772 (Why is no real title available?)
• All solutions of the stochastic fixed point equation of the Quicksort process
• Stochastic fixed-point equations
• A survey of multivariate aspects of the contraction method
• A Stochastic Maximin Fixed-Point Equation Related to Game Tree Evaluation
• On stochastic recursive equations of sum and max type
• The functional equation of the smoothing transform
• A stochastic fixed point equation for weighted minima and maxima
• Random recurrence equations and ruin in a Markov-dependent stochastic economic environment
• Smoothing equations for large Pólya urns

This page was built for publication: Analysis of algorithms by the contraction method: additive and max-recursive sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5718849)