Skip to Main content Skip to Navigation
New interface
Reports (Research report)

A Probabilistic Analysis of Some Tree Algorithms

Abstract : 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 complex analysis techniques as it is usually the case. This approach gives a unified probabilistic treatment of these questions. It simplifies and extends some of the results known in this domain.
Document type :
Reports (Research report)
Complete list of metadata
Contributor : Rapport De Recherche Inria Connect in order to contact the contributor
Submitted on : Friday, May 19, 2006 - 8:56:51 PM
Last modification on : Thursday, October 27, 2022 - 4:02:28 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:31:45 PM


  • HAL Id : inria-00070586, version 1


Hanene Mohamed, Philippe Robert. A Probabilistic Analysis of Some Tree Algorithms. [Research Report] RR-5420, INRIA. 2005, pp.31. ⟨inria-00070586⟩



Record views


Files downloads