Dynamic Placement of Records in Linear Storage

DOI10.1145/322077.322085MaRDI QIDQ4158452zbMATH OpenOpenAlexFDO

Authors

Publication date 1978

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/322077.322085

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(2)

• Dynamic placement of records and the classical occupancy problem
• Optimization and approximation algorithm for placement of records on linear storage devices

This page was built for publication: Dynamic Placement of Records in Linear Storage

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4158452)