DOIAbstract
We study a variant of the Rényi parking problem in which car length is repeatedly halvedand determine the rate at which the remaining space decays
We study a variant of the Rényi parking problem in which car length is repeatedly halvedand determine the rate at which the remaining space decays
We show that the spacing distribution between parked cars can be obtained as a solution of certain l...
We consider the classical discrete parking problem, in which cars arrive uniformly at random on any ...
[[abstract]]We drive a car along a street towards our destination and look for an available parking ...
In the Page parking (or packing) model on a discrete interval (also known as the discrete Rényi pac...
Background. A generalization of the A. Rényi’s stochastic parking model is considered. In our model,...
The present work consider a natural discretization of Rényi’s so-called “parking problem”. Let l, n...
The work is devoted to the study of a new model of random filling of a segment of large length with...
International audienceIn the Page parking (or packing) model on a discrete interval (also known as t...
Suppose that $m$ drivers each choose a preferred parking space in a linear car park with $n$ spaces....
In this paper, we propose to investigate one of the models of the discrete analogue of the Renyi pr...
We consider two variations of the discrete car parking problem where at every vertex of Z cars (part...
Consider an infinite tree with random degrees, i.i.d. over the sites, with a prescribed probability ...
In this paper, we investigate a parking process on a uniform random rooted plane tree with n vertice...
Parking in major cities is an expensive and annoying affair, the reason ascribed to the limited avai...
Consider an infinite tree with random degrees, i.i.d. over the sites, with a prescribed probability ...
We show that the spacing distribution between parked cars can be obtained as a solution of certain l...
We consider the classical discrete parking problem, in which cars arrive uniformly at random on any ...
[[abstract]]We drive a car along a street towards our destination and look for an available parking ...
In the Page parking (or packing) model on a discrete interval (also known as the discrete Rényi pac...
Background. A generalization of the A. Rényi’s stochastic parking model is considered. In our model,...
The present work consider a natural discretization of Rényi’s so-called “parking problem”. Let l, n...
The work is devoted to the study of a new model of random filling of a segment of large length with...
International audienceIn the Page parking (or packing) model on a discrete interval (also known as t...
Suppose that $m$ drivers each choose a preferred parking space in a linear car park with $n$ spaces....
In this paper, we propose to investigate one of the models of the discrete analogue of the Renyi pr...
We consider two variations of the discrete car parking problem where at every vertex of Z cars (part...
Consider an infinite tree with random degrees, i.i.d. over the sites, with a prescribed probability ...
In this paper, we investigate a parking process on a uniform random rooted plane tree with n vertice...
Parking in major cities is an expensive and annoying affair, the reason ascribed to the limited avai...
Consider an infinite tree with random degrees, i.i.d. over the sites, with a prescribed probability ...
We show that the spacing distribution between parked cars can be obtained as a solution of certain l...
We consider the classical discrete parking problem, in which cars arrive uniformly at random on any ...
[[abstract]]We drive a car along a street towards our destination and look for an available parking ...
Add to ORKG