Random Records and Cuttings in Split Trees: Extended Abstract - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2008

Random Records and Cuttings in Split Trees: Extended Abstract

Résumé

We study the number of records in random split trees on $n$ randomly labelled vertices. Equivalently the number of random cuttings required to eliminate an arbitrary random split tree can be studied. After normalization the distributions are shown to be asymptotically $1$-stable. This work is a generalization of our earlier results for the random binary search tree which is one specific case of split trees. Other important examples of split trees include $m$-ary search trees, quadtrees, median of $(2k+1)$-trees, simplex trees, tries and digital search trees.
Fichier principal
Vignette du fichier
dmAI0117.pdf (245.88 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01194685 , version 1 (07-09-2015)

Identifiants

Citer

Cecilia Holmgren. Random Records and Cuttings in Split Trees: Extended Abstract. Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. pp.269-282, ⟨10.46298/dmtcs.3570⟩. ⟨hal-01194685⟩

Collections

TDS-MACS
63 Consultations
671 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More