Dynamic placement of records and the classical occupancy problem

DOI10.1016/0898-1221(81)90117-6zbMath0446.68015OpenAlexW2049370018MaRDI QIDQ1145997

András A. Benczúr, Matyas Arato

Publication date: 1980

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(81)90117-6

zbMATH Keywords

dynamic allocationoccupancy problemdynamic placement of recordsfilinglinear storage

Mathematics Subject Classification ID

Data structures (68P05) Theory of operating systems (68N25)

Related Items (2)

Refined large deviation asymptotics for the classical occupancy problem ⋮ Measures of distinctness for random partitions and compositions of an integer

Cites Work

• Dynamic Placement of Records in Linear Storage
• On the Optimality of the Probability Ranking Scheme in Storage Applications
• Minimizing expected travel time on geometrical patterns by optimal probability rearrangements
• Placement of Records on a Secondary Storage Device to Minimize Access Time
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Dynamic placement of records and the classical occupancy problem