Add to ORKGIn this paper several limit theorems are proved for the fluctuations of the queue size during the initial busy period of a queuing process with one server. These theorems are used to find the solutions of various problems connected with the heights and widths of random rooted trees. Key words: heights and widths. Single-server queues, queue size, random trees
A ballot theorem is a theorem that yields information about the conditional probability that a rando...
The tree-depth of a graph G is a parameter that plays a crucial role in the theory of bounded expans...
We prove limit theorems for sums of functions of subtrees of binary search trees and random recursiv...
An examination is made of a queueing system M vertical G vertical 1 for which the intensity of servi...
Priority trees are a certain data structure used for priority queue administration. Under the model ...
In this paper limit theorems for closed queuing networks with excess of servers are formulated and ...
We investigate scaling limits of several types of random trees. The study of scaling limits of rand...
This thesis considers queueing systems affected by a random environment. The behaviour of these queu...
Abstract—This paper analyzes queueing behavior in queues with a random number of parallel flows, and...
The number of binary trees of fixed size and given height is estimated asymptotically near the peak ...
AbstractWe consider random tries and random PATRICIA trees constructed from n independent strings of...
AbstractDenote by Sn the set of all distinct rooted binary trees with n unlabeled vertices. Define σ...
We prove general limit theorems for sums of functions of subtrees of (random) binary search trees an...
Devroye (SIAM J. Comput. 28 (1999) 1215-1224) computed the average size of several random hash-based...
The aim is to develop the methods for investigation of the random forestes, to obtain the total desc...
A ballot theorem is a theorem that yields information about the conditional probability that a rando...
The tree-depth of a graph G is a parameter that plays a crucial role in the theory of bounded expans...
We prove limit theorems for sums of functions of subtrees of binary search trees and random recursiv...
An examination is made of a queueing system M vertical G vertical 1 for which the intensity of servi...
Priority trees are a certain data structure used for priority queue administration. Under the model ...
In this paper limit theorems for closed queuing networks with excess of servers are formulated and ...
We investigate scaling limits of several types of random trees. The study of scaling limits of rand...
This thesis considers queueing systems affected by a random environment. The behaviour of these queu...
Abstract—This paper analyzes queueing behavior in queues with a random number of parallel flows, and...
The number of binary trees of fixed size and given height is estimated asymptotically near the peak ...
AbstractWe consider random tries and random PATRICIA trees constructed from n independent strings of...
AbstractDenote by Sn the set of all distinct rooted binary trees with n unlabeled vertices. Define σ...
We prove general limit theorems for sums of functions of subtrees of (random) binary search trees an...
Devroye (SIAM J. Comput. 28 (1999) 1215-1224) computed the average size of several random hash-based...
The aim is to develop the methods for investigation of the random forestes, to obtain the total desc...
A ballot theorem is a theorem that yields information about the conditional probability that a rando...
The tree-depth of a graph G is a parameter that plays a crucial role in the theory of bounded expans...
We prove limit theorems for sums of functions of subtrees of binary search trees and random recursiv...