Truszczynski, Miroslaw Once more on storage for consecutive retrieval. (English) Zbl 0427.68071 Inf. Process. Lett. 10, 21-24 (1980). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page MSC: 68P20 Information storage and retrieval of data 68P05 Data structures 68R99 Discrete mathematics in relation to computer science 68Q25 Analysis of algorithms and problem complexity Keywords:file organization; storage requirements; consecutive retrieval; storage redundancy; linear organization Citations:Zbl 0327.68093; Zbl 0354.68034 PDFBibTeX XMLCite \textit{M. Truszczynski}, Inf. Process. Lett. 10, 21--24 (1980; Zbl 0427.68071) Full Text: DOI References: [1] Ehrich, H.-D.; Lipski, W., On the storage space requirement of consecutive retrieval with redundancy, Information Processing lett., 4, 101-104 (1976) · Zbl 0327.68093 [2] Ghosh, S. P., Consecutive storage of relevant records with redundancy, Comm. ACM, 18, 464-471 (1975) · Zbl 0305.68021 [3] Gupta, U., Bounds on storage for consecutive retrieval, J. ACM, 26, 28-36 (1979) · Zbl 0388.68086 [4] Kou, L. T., Polynomial complete consecutive information retrieval problems, SIAM J. Comput., 6, 67-75 (1977) · Zbl 0354.68036 [5] Lipski, W., Information storage and retrieval — mathematical foundations II (Combinatorial problems), Theoret. Comput. Sci., 3, 183-212 (1976) [6] Luccio, F.; Preparata, F. P., Storage for consecutive retrieval, Information Processing Lett., 5, 68-71 (1976) · Zbl 0354.68034 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.