Consecutive storage of relevant records with redundancy
From MaRDI portal
Publication:4061944
DOI10.1145/360933.360991zbMath0305.68021OpenAlexW2073065601MaRDI QIDQ4061944
Publication date: 1975
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/360933.360991
Related Items
Once more on storage for consecutive retrieval ⋮ Short k‐radius sequences, k‐difference sequences and universal cycles ⋮ Consecutive retrieval with redundancy: An optimal linear and an optimal cyclic arrangement and their storage space requirements ⋮ The existence of \(k\)-radius sequences ⋮ Constructions of asymptotically shortest \(k\)-radius sequences ⋮ On the storage space requirement of consecutive retrieval with redundancy ⋮ Algorithmic approach to the consecutive retrieval property ⋮ Partition of a query set into minimal number of subsets having consecutive retrieval property ⋮ Constructing Optimal $k$-Radius Sequences ⋮ Note on a construction of short \(k\)-radius sequences ⋮ On strings containing all subsets as substrings ⋮ Sequences of large radius ⋮ Constructing 𝑘-radius sequences ⋮ Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
