{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T10:35:38Z","timestamp":1757586938644,"version":"3.30.2"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1978]]},"DOI":"10.1007\/bf00288886","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T16:06:46Z","timestamp":1096906006000},"page":"273-292","source":"Crossref","is-referenced-by-count":38,"title":["Data encodings and their costs"],"prefix":"10.1007","volume":"9","author":[{"given":"Arnold L.","family":"Rosenberg","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. Proc. 3rd ACM Symp. on Theory of Computing, 1970, pp. 151?158","DOI":"10.1145\/800157.805047"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"DeMillo, R.A., Eisenstat, S.C., Lipton, R.E.: Preserving average proximity in arrays. Comm. ACM (to appear)","DOI":"10.1145\/359361.359447"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1145\/321724.321726","volume":"19","author":"P.C. Fischer","year":"1972","unstructured":"Fischer, P.C., Meyer, A.R., Rosenberg, A.L.: Real-time simulation of multihead tape units. J. Assoc. Comput. Mach. 19, 590?607 (1972)","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR4","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S., Knuth, D.E.: Complexity results for bandwidth minimization. Unpublished typescript, 1977"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1, 237?267 (1976)","journal-title":"Theoret. Comput. Sci."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00263586","volume":"3","author":"C.C. Gotlieb","year":"1974","unstructured":"Gotlieb, C.C., Tompa, F.W.: Choosing a storage schema. Acta Informat. 3, 297?319 (1974)","journal-title":"Acta Informat."},{"key":"CR7","unstructured":"Hardy, G.H., Littlewood, J.E., P\u00f3lya, G.: Inequalities. Cambridge Univ. Press 1967"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0112012","volume":"12","author":"L.H. Harper","year":"1964","unstructured":"Harper, L.H.: Optimal assignments of numbers to vertices. J. Soc. Indust. Appl. Math. 12, 131?135 (1964)","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/S0021-9800(66)80059-5","volume":"1","author":"L.H. Harper","year":"1966","unstructured":"Harper, L.H.: Optimal numberings and isoperimetric problems. J. Combinatorial Theory 1, 385?393 (1966)","journal-title":"J. Combinatorial Theory"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/S0019-9958(65)90399-2","volume":"8","author":"F.C. Hennie","year":"1965","unstructured":"Hennie, F.C.: One-tape, off-line Turing machine computations. Information and Control 8, 553?578 (1965)","journal-title":"Information and Control"},{"key":"CR11","first-page":"109","volume":"31","author":"M.A. Iordansk'ii","year":"1976","unstructured":"Iordansk'ii, M.A.: Minimalnye numeratsii vershin derevyev [in Russian]. Problemy Kibernet. 31, 109?132 (1976)","journal-title":"Problemy Kibernet."},{"key":"CR12","volume-title":"The art of computer programming. I. Fundamental algorithms","author":"D.E. Knuth","year":"1968","unstructured":"Knuth, D.E.: The art of computer programming. I. Fundamental algorithms. Reading, MA: Addison-Wesley 1968"},{"key":"CR13","volume-title":"The art of computer programming. III. Sorting and searching","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The art of computer programming. III. Sorting and searching. Reading, MA: Addison-Wesley 1973"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1145\/321978.321990","volume":"23","author":"R.E. Lipton","year":"1976","unstructured":"Lipton, R.E., Eisenstat, S.C., DeMillo, R.A.: Space and time hierarchies for classes of control structures and data structures. J. Assoc. Comput. Mach. 23, 720?732 (1976)","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF02280884","volume":"16","author":"Ch. H. Papadimitriou","year":"1976","unstructured":"Papadimitriou, Ch. H.: The NP-completeness of the bandwidth minimization problem. Computing 16, 263?270 (1976)","journal-title":"Computing"},{"key":"CR16","unstructured":"Pippenger, N., Fischer, M.J.: Relations among complexity measures. IBM Report RC-6569, 1977"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1145\/321892.321898","volume":"22","author":"J.L. Pfaltz","year":"1975","unstructured":"Pfaltz, J.L.: Representing graphs by Knuth trees. J. Assoc. Comput. Mach. 22, 361?366 (1975)","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1137\/0204038","volume":"4","author":"A.L. Rosenberg","year":"1975","unstructured":"Rosenberg, A.L.: Preserving proximity in arrays. SIAM J. Comput. 4, 443?460 (1975)","journal-title":"SIAM J. Comput."},{"key":"CR19","series-title":"IBM Report RC-5798","volume-title":"Current trends in programming methodology. IV. Data structuring","author":"A.L. Rosenberg","year":"1976","unstructured":"Rosenberg, A.L.: Storage mappings for extendible arrays. IBM Report RC-5798, 1976. In: Current trends in programming methodology. IV. Data structuring (R.T. Yeh, ed.). Englewood Cliffs, NJ: Prentice-Hall (to appear)"},{"key":"CR20","doi-asserted-by":"crossref","unstructured":"Rosenberg, A.L., Snyder, L.: Bounds on the costs of data encodings. Math. Systems theory (to appear)","DOI":"10.1007\/BF01776564"},{"key":"CR21","unstructured":"Scheuermann, P., Heller, J.: A view of logical data organization and its mapping to physical storage. Proc. 3rd Texas Conf. on Computing Systems, 1974"},{"key":"CR22","unstructured":"Sekanina, M.: On an ordering of the set of vertices of a connected graph. Publ. Fac. Sci. Univ. Brno, No. 412, 137?142 (1960)"},{"key":"CR23","first-page":"63","volume":"29","author":"M.A. Sheidvasser","year":"1974","unstructured":"Sheidvasser, M.A.: O dline i shirine razmeshchenii grafov v reshetkakh [in Russian]. Problemy Kibernet. 29, 63?102 (1974)","journal-title":"Problemy Kibernet."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF00991070","volume":"5","author":"B. Shneiderman","year":"1976","unstructured":"Shneiderman, B., Shapiro, S.C.: Toward a theory of encoded data structures and data translation. Internat. J. Comput. Information Sci. 5, 33?43 (1976)","journal-title":"Internat. J. Comput. Information Sci."},{"key":"CR25","unstructured":"Standish, T.A.: Data structures ? an axiomatic approach. In: Current trends in programming methodology. IV. Data structuring (R.T. Yeh, ed.). Englewood Cliffs, NJ: Prentice-Hall (to appear)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288886.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00288886\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288886","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T21:18:21Z","timestamp":1734556701000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00288886"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1978]]}},"alternative-id":["BF00288886"],"URL":"https:\/\/doi.org\/10.1007\/bf00288886","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[1978]]}}}