Storage for consecutive retrieval

DOI10.1016/0020-0190(76)90066-1MaRDI QIDQ1236880zbMATH OpenOpenAlexFDO

Authors K. Appert

Publication date 1976

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(76)90066-1

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Information storage and retrieval of data (68P20)

Cites work

• scientific article; zbMATH DE number 3509758 (Why is no real title available?)
• On the storage space requirement of consecutive retrieval with redundancy

Cited in

(6)

• Preemptive scheduling and antichain polyhedra
• Once more on storage for consecutive retrieval
• On strings containing all subsets as substrings
• Algorithmic characterizations of interval orderd hypergraphs and applications
• Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results
• On the consecutive retrieval property for generalized binary queries

This page was built for publication: Storage for consecutive retrieval

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