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
Complete list of metadatas

https://hal.inria.fr/inria-00070586
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 8:56:51 PM
Last modification on : Friday, May 25, 2018 - 12:02:03 PM
Long-term archiving on : Sunday, April 4, 2010 - 9:31:45 PM

Identifiers

  • HAL Id : inria-00070586, version 1

Collections

Citation

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

Share

Metrics

Record views

261

Files downloads

343