Analysis of some parameters for random nodes in priority trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2008

Analysis of some parameters for random nodes in priority trees

Abstract

Priority trees are a certain data structure used for priority queue administration. Under the model that all permutations of the numbers 1, . . . , n are equally likely to construct a priority tree of size n we study the following parameters in size-n trees: depth of a random node, number of right edges to a random node, and number of descendants of a random node. For all parameters studied we give limiting distribution results.
Fichier principal
Vignette du fichier
546-3234-1-PB.pdf (373.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00972322 , version 1 (03-04-2014)

Identifiers

Cite

Alois Panholzer. Analysis of some parameters for random nodes in priority trees. Discrete Mathematics and Theoretical Computer Science, 2008, Vol. 10 no. 2 (2), pp.1--37. ⟨10.46298/dmtcs.447⟩. ⟨hal-00972322⟩

Collections

TDS-MACS
60 View
718 Download

Altmetric

Share

Gmail Facebook X LinkedIn More