Abstract
The study of bidimensional data organization in a general sense has been initiated in 1976 [1]. Previously, the only contribution of some interest had been specifically referred to drum-type storage [2].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E.LODI, F.LUCCIO, C.MUGNAI and L.PAGLI: A preliminary Investigation on two dimensional data organization. Proc. Congresso A. I. C. A., 1976.
S.P.GOSH: File organization: consecutive storage of relevant records on drum-type storage. Information and Control 25 (1974), 145–160.
C.K.WONG: Data arrangement in magnetic bubble memories. Proc. 15-th Allerton Conference, 1977.
E.LODI, F.LUCCIO, C.MUGNAI and L.PAGLI: On two dimensional data organization. Fundamenta Informaticae I I (1978).
W.LIPSKI, E.LODI, F.LUCCIO, C.MUGNAI and L.PAGLI: On two dimensional data organization II. Fundamenta Informaticae I I (1978).
W.J.MASEK: Some NP-complete set covering problems. M.I.T. manuscript, 1979.
V.KLEE: Can the measure of U’[ai,bi] be computed in less than 0(n log n) steps? American Math. Monthly 84 (1977), 284–285.
U.LAUTHER: 4-dimensional binary search trees as a means to speed up associative searches in design rule verification of integrated circuits. J. of Design Automation and Fault-Tolerant Computing 2 (1978), 241–247.
J.L.BENTLEY and M.I.SHAMOS: Optimal algorithms for structuring geographic data. Proc. Symp: on Topological Data Structures for Geographic Information Systems, 1977.
W.LIPSKI and F.P.PREPARATA: Finding the contour of a union of iso-oriented rectangles. U. of Illinois manuscript, 1979.
W.LIPSKI: Finding a Manhattan path and related problems. U. of Illinois manuscript, 1979.
F.LUCCIO and C.MUGNAI: Hamiltonian paths on a rectangular chessboard. Proc. 16-th Allerto. Conference, 1978.
D.E.KNUTH: Big omicron and big omega and big theta. Sigact News (1976), 18–24.
J.E.HOPCROFT and R.M.KARP: Ann 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. on Computing 2 (1973), 225–231.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer-Verlag Wien
About this chapter
Cite this chapter
Luccio, F. (1981). Data Structures for Bidimensional Memory. In: Ausiello, G., Lucertini, M. (eds) Analysis and Design of Algorithms in Combinatorial Optimization. International Centre for Mechanical Sciences, vol 266. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2748-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-7091-2748-3_5
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-81626-4
Online ISBN: 978-3-7091-2748-3
eBook Packages: Springer Book Archive