This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Ehrich H.D., Lipski W. On the storage space requirement of consecutive retrieval with redundancy. Inf. Proc. Lett. 4, 1976, 101–104.
Fulkerson D.S., Gross O.A. Incidence matrices and interval graphs. Pacif. Jour. Math. 15, 1965, 835–855.
Ghosh S.P. File organization. The consecutive retrieval property. Comm. ACM 15, 1972, 802–808.
Ghosh S.P. On the theory of consecutive storage of relevant records. Inform. Sci. 6, 1973, 1–9.
Ghosh S.P. Consecutive storage of relevant records with redundancy. Comm. ACM 18, 1975, 464–471.
Górski J. An effective algorithm for finding partitions of a given set. To appear.
Górski J. Memory organization for effective information retrieval. Doctoral thesis, CC PAS, 1976, Warsaw. In Polish.
Kou L.T. Polynomial complete consecutive information retrieval problems. Technical Report TR74-193, Dept. of Comp. Sci., Cornell University, Ithaca, NY, 1974.
Kuratowski K., Mostowski A. Set Theory. North Holland, Amsterdam, 1967.
Lipski W. Combinatorial aspects of information storage and retrieval. Proc. MFCS 74, Springer-Verlag, Berlin-Heidelberg-New York 1975, 270–279.
Lipski W., Marek W. File organization, an application of graph theory. Proc. Collq. Automata, Languages and Progr., Saarbrücken, 1974, 270–279.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Górski, J. (1976). On consecutive storage of records. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_191
Download citation
DOI: https://doi.org/10.1007/3-540-07854-1_191
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07854-8
Online ISBN: 978-3-540-38169-3
eBook Packages: Springer Book Archive