Étude Probabiliste d'Algorithmes en Arbre

Abstract : In this thesis 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. This approach gives a unified probabilistic treatment of these questions. It simplifies and extends some of the results known in this domain.
Document type :
Theses
Mathématiques [math]. Université Pierre et Marie Curie - Paris VI, 2007. Français


https://tel.archives-ouvertes.fr/tel-00270742
Contributor : Hanene Mohamed <>
Submitted on : Monday, April 7, 2008 - 1:08:44 PM
Last modification on : Wednesday, October 12, 2016 - 1:23:53 AM
Document(s) archivé(s) le : Friday, May 21, 2010 - 1:25:02 AM

Identifiers

  • HAL Id : tel-00270742, version 1

Collections

Citation

Hanene Mohamed. Étude Probabiliste d'Algorithmes en Arbre. Mathématiques [math]. Université Pierre et Marie Curie - Paris VI, 2007. Français. <tel-00270742>

Export

Share

Metrics

Record views

413

Document downloads

117