Packing random intervals on-line

DOI10.1007/PL00009233zbMath0914.68082OpenAlexW2030843823MaRDI QIDQ1277374

Leopold Flatto, Bjorn Poonen, Edward G. jun. Coffman, Predrag Jelenković

Publication date: 2 February 1999

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009233

zbMATH Keywords

multimedia communication systemsparking probleme

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (16)

Limit theory for random sequential packing and deposition ⋮ Counting intervals in the packing process ⋮ Per-site occupancy in the discrete parking problem ⋮ Scaling properties of the number of random sequential adsorption iterations needed to generate saturated random packing ⋮ Gaussian limits for multidimensional random sequential packing at saturation ⋮ Statistical and renewal results for the random sequential adsorption model applied to a unidirectional multicracking problem ⋮ Limit theorems for monotonic particle systems and sequential deposition. ⋮ Moderate deviations for stabilizing functionals in geometric probability ⋮ Space filling and depletion ⋮ Gaussian limits for random measures in geometric probability ⋮ Asymptotic Properties of Collective-Rearrangement Algorithms ⋮ Moderate deviations for some point measures in geometric probability ⋮ Queues with advanced reservations: an infinite-server proxy for the bookings diary ⋮ Last-Mile Shared Delivery: A Discrete Sequential Packing Approach ⋮ Interval packing: the vacant interval distribution. ⋮ Multilayer random sequential adsorption

This page was built for publication: Packing random intervals on-line