The Annals of Applied Probability
- Ann. Appl. Probab.
- Volume 15, Number 4 (2005), 2445-2471.
A probabilistic analysis of some tree algorithms
In this paper a general class of tree algorithms is analyzed. It is shown that, by using an appropriate probabilistic representation of the quantities of interest, the asymptotic behavior of these algorithms can be obtained quite easily without resorting to the usual complex analysis techniques. This approach gives a unified probabilistic treatment of these questions. It simplifies and extends some of the results known in this domain.
Ann. Appl. Probab., Volume 15, Number 4 (2005), 2445-2471.
First available in Project Euclid: 7 December 2005
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Primary: 68W40: Analysis of algorithms [See also 68Q25] 60K20: Applications of Markov renewal processes (reliability, queueing networks, etc.) [See also 90Bxx]
Secondary: 90B15: Network models, stochastic
Mohamed, Hanène; Robert, Philippe. A probabilistic analysis of some tree algorithms. Ann. Appl. Probab. 15 (2005), no. 4, 2445--2471. doi:10.1214/105051605000000494. https://projecteuclid.org/euclid.aoap/1133965768