Dynamic placement of records and the classical occupancy problem
type: Item
instance of: scholarly article
title: Dynamic placement of records and the classical occupancy problem
zbMATH Open document ID: 0446.68015
DOI: 10.1016/0898-1221(81)90117-6
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68N25
zbMATH DE Number: 3698362
zbMATH Keywords: dynamic placement of records
zbMATH Keywords: occupancy problem
zbMATH Keywords: dynamic allocation
zbMATH Keywords: linear storage
zbMATH Keywords: filing
author: Mátyás Arató
author: András A. Benczúr
MaRDI profile type: Publication
full work available at URL: 0898-1221(81)90117-6
OpenAlex ID: W2049370018
cites work: Q5812325
cites work: Minimizing expected travel time on geometrical patterns by optimal probability rearrangements
cites work: On the Optimality of the Probability Ranking Scheme in Storage Applications
cites work: Dynamic Placement of Records in Linear Storage
cites work: Q4113392
cites work: Q4139668
cites work: Q3908462
cites work: Q5620889
cites work: Placement of Records on a Secondary Storage Device to Minimize Access Time
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 3698362