Add to ORKGPriority 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
Devroye (SIAM J. Comput. 28 (1999) 1215-1224) computed the average size of several random hash-based...
A widely used class of binary trees is studied in order to provide information useful in evaluating ...
AbstractWe introduce the bucket recursive tree, a generalization of recursive trees. The tree grows ...
Priority trees are a certain data structure used for priority queue administration. Under the model ...
Analysis of AlgorithmsPriority trees are a certain data structure used for priority queue administra...
Abstract. In this survey we present results and the used proof techniques concerning the analysis of...
The tree-depth of a graph G is a parameter that plays a crucial role in the theory of bounded expans...
In this paper several limit theorems are proved for the fluctuations of the queue size during the in...
AbstractLet r be any integer ≥2. There exist absolute constants C1 and C2 such that if G(N, p) denot...
We show that in Erdos-Renyi random graph G(n, p) with high probability, when p = c/n and c is a cons...
A widely used class of binary trees is studied in order to provide information useful in evaluating ...
Abstract. We study for various tree families the distribution of the number of edge-disjoint paths r...
This paper deals with statistics concerning distances between randomly chosen nodes in varieties of ...
This paper deals with statistics concerning distances between randomly chosen nodes in varieties o...
Asymptotics are a major domain of interest in stochastic modelling as low-probability events are har...
Devroye (SIAM J. Comput. 28 (1999) 1215-1224) computed the average size of several random hash-based...
A widely used class of binary trees is studied in order to provide information useful in evaluating ...
AbstractWe introduce the bucket recursive tree, a generalization of recursive trees. The tree grows ...
Priority trees are a certain data structure used for priority queue administration. Under the model ...
Analysis of AlgorithmsPriority trees are a certain data structure used for priority queue administra...
Abstract. In this survey we present results and the used proof techniques concerning the analysis of...
The tree-depth of a graph G is a parameter that plays a crucial role in the theory of bounded expans...
In this paper several limit theorems are proved for the fluctuations of the queue size during the in...
AbstractLet r be any integer ≥2. There exist absolute constants C1 and C2 such that if G(N, p) denot...
We show that in Erdos-Renyi random graph G(n, p) with high probability, when p = c/n and c is a cons...
A widely used class of binary trees is studied in order to provide information useful in evaluating ...
Abstract. We study for various tree families the distribution of the number of edge-disjoint paths r...
This paper deals with statistics concerning distances between randomly chosen nodes in varieties of ...
This paper deals with statistics concerning distances between randomly chosen nodes in varieties o...
Asymptotics are a major domain of interest in stochastic modelling as low-probability events are har...
Devroye (SIAM J. Comput. 28 (1999) 1215-1224) computed the average size of several random hash-based...
A widely used class of binary trees is studied in order to provide information useful in evaluating ...
AbstractWe introduce the bucket recursive tree, a generalization of recursive trees. The tree grows ...