At each stage of the packing of a closed interval K, a random number of random open intervals (the packing objects) are placed in that part of K which is as yet unoccupied. No overlapping between the ...

This is a preview. Log in through your library . Abstract One-dimensional random packing, known as the car-parking problem, was first analyzed by Rényi (1958). A stochastic version of Kakutani's (1975 ...