{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T08:10:52Z","timestamp":1776931852150,"version":"3.51.2"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1978,12,1]],"date-time":"1978-12-01T00:00:00Z","timestamp":281318400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1978,12]]},"DOI":"10.1007\/bf01776564","type":"journal-article","created":{"date-parts":[[2005,6,18]],"date-time":"2005-06-18T06:29:16Z","timestamp":1119076156000},"page":"9-39","source":"Crossref","is-referenced-by-count":40,"title":["Bounds on the costs of data encodings"],"prefix":"10.1007","volume":"12","author":[{"given":"Arnold L.","family":"Rosenberg","sequence":"first","affiliation":[]},{"given":"Lawrence","family":"Snyder","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01776564_CR1","doi-asserted-by":"crossref","unstructured":"R. A. DeMillo, S. C. Eisenstat, and R. J. Lipton, Preserving average proximity in arrays,C. ACM, 21, 228\u2013231.","DOI":"10.1145\/359361.359447"},{"key":"BF01776564_CR2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00263586","volume":"3","author":"C. C. Gotlieb","year":"1974","unstructured":"C. C. Gotlieb and F. W. Tompa, Choosing a storage schema,Acta Inform. 3, 297\u2013319 (1974).","journal-title":"Acta Inform."},{"key":"BF01776564_CR3","unstructured":"G. H. Hardy, J. E. Littlewood, and G. Polya,Inequalities, Cambridge Univ. Press, 1967."},{"key":"BF01776564_CR4","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0112012","volume":"12","author":"L. H. Harper","year":"1964","unstructured":"L. H. Harper, Optimal assignments of numbers to vertices,J. Soc. Indust. Appl. Math., 12, 131\u2013135 (1964).","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"BF01776564_CR5","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/S0021-9800(66)80059-5","volume":"1","author":"L. H. Harper","year":"1966","unstructured":"L. H. Harper, Optimal numberings and isoperimetric problems on graphs,J. Comb. Th., 1, 385\u2013393 (1966).","journal-title":"J. Comb. Th."},{"key":"BF01776564_CR6","first-page":"109","volume":"31","author":"M. A. Iordansk'ii","year":"1976","unstructured":"M. A. Iordansk'ii, Minimalnye numeratsii vershin derevyev (in Russian),Problemy Kibernetiki, 31, 109\u2013132 (1976).","journal-title":"Problemy Kibernetiki"},{"key":"BF01776564_CR7","volume-title":"The Art of Computer Programming I: Fundamental Algorithms","author":"D. E. Knuth","year":"1968","unstructured":"D. E. Knuth,The Art of Computer Programming I: Fundamental Algorithms, Addison-Wesley, Reading, MA, 1968."},{"key":"BF01776564_CR8","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1145\/321978.321990","volume":"23","author":"R. J. Lipton","year":"1976","unstructured":"R. J. Lipton, S. C. Eisenstat, and R. A. DeMillo, Space and time hierarchies for classes of control structures and data structures,J. ACM, 23, 720\u2013732 (1976).","journal-title":"J. ACM"},{"key":"BF01776564_CR9","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1145\/321892.321898","volume":"22","author":"J. L. Pfaltz","year":"1975","unstructured":"J. L. Pfaltz, Representing graphs by Knuth trees,J. ACM, 22, 361\u2013366 (1975).","journal-title":"J. ACM"},{"key":"BF01776564_CR10","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1137\/0204038","volume":"4","author":"A. L. Rosenberg","year":"1975","unstructured":"A. L. Rosenberg, Preserving proximity in arrays,SIAM J. Comput., 4, 443\u2013460 (1975).","journal-title":"SIAM J. Comput."},{"key":"BF01776564_CR11","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF00288886","volume":"9","author":"A. L. Rosenberg","year":"1978","unstructured":"A. L. Rosenberg, Data encodings and their costs,Acta Inform, 9, 273\u2013292 (1978).","journal-title":"Acta Inform"},{"key":"BF01776564_CR12","unstructured":"A. L. Rosenberg, Encoding data structures in trees, IBM RC-6793, 1977; submitted for publication."},{"key":"BF01776564_CR13","unstructured":"P. Scheuermann and J. Heller, A view of logical data organization and its mapping to physical storage,Proc. 3rd Texas Conf. on Computing Systems, 1974."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01776564.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01776564\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01776564","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T13:03:31Z","timestamp":1557407011000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01776564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,12]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1978,12]]}},"alternative-id":["BF01776564"],"URL":"https:\/\/doi.org\/10.1007\/bf01776564","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978,12]]}}}