Storage for consecutive retrieval

DOI10.1016/0020-0190(76)90066-1zbMath0354.68034OpenAlexW1986987796MaRDI QIDQ1236880

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

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

Related Items (6)

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

Cites Work

• On the storage space requirement of consecutive retrieval with redundancy
• Unnamed Item

This page was built for publication: Storage for consecutive retrieval