On the asymptotic behavior of some algorithms

DOI10.1002/RSA.20075MaRDI QIDQ5318248zbMATH OpenOpenAlexFDO

Authors Philippe Robert

Publication date 22 September 2005

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0502014

zbMATH Keywords

asymptotic oscillating behaviorethernetMellin transformPoisson transformsplitting algorithmstree communication protocol

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Abstract: A simple approach is presented to study the asymptotic behavior of some algorithms with an underlying tree structure. It is shown that some asymptotic oscillating behaviors can be precisely analyzed without resorting to complex analysis techniques as it is usually done in this context. A new explicit representation of periodic functions involved is obtained at the same time.

Recommendations

• A probabilistic analysis of some tree algorithms
• scientific article; zbMATH DE number 58317
• Distributional asymptotics in the analysis of algorithms: periodicities and discretization
• A complexity calculus for recursive tree algorithms
• scientific article; zbMATH DE number 4039927

Cited in

(8)

• On the asymptotic behaviour of the Aragón Artacho-Campoy algorithm
• A probabilistic analysis of some tree algorithms
• Analysis of Steiner subtrees of random trees for traceroute algorithms
• Distributional asymptotics in the analysis of algorithms: periodicities and discretization
• scientific article; zbMATH DE number 4039146 (Why is no real title available?)
• scientific article; zbMATH DE number 4066861 (Why is no real title available?)
• A survey on performance analysis of warehouse carousel systems
• Some properties of the alternating separation (AS) and ASAP algorithm

This page was built for publication: On the asymptotic behavior of some algorithms

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