{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T13:22:32Z","timestamp":1773321752267,"version":"3.50.1"},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1980,6,1]],"date-time":"1980-06-01T00:00:00Z","timestamp":328665600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12099,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1980,6]]},"DOI":"10.1016\/0304-3975(80)90043-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"145-165","source":"Crossref","is-referenced-by-count":9,"title":["Uniform data encodings"],"prefix":"10.1016","volume":"11","author":[{"given":"Arnold L.","family":"Rosenberg","sequence":"first","affiliation":[]},{"given":"Larry J.","family":"Stockmeyer","sequence":"additional","affiliation":[]},{"given":"Lawrence","family":"Snyder","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(80)90043-2_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(80)90043-2_BIB2","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971","journal-title":"Proc. 3rd ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(80)90043-2_BIB3","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00263586","article-title":"Choosing a storage schema","volume":"3","author":"Gotlieb","year":"1974","journal-title":"Acta Informat."},{"key":"10.1016\/0304-3975(80)90043-2_BIB4","series-title":"Ph.D. Thesis","article-title":"On the time and tape complexity of languages","author":"Hunt","year":"1973"},{"key":"10.1016\/0304-3975(80)90043-2_BIB5","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/S0022-0000(76)80038-4","article-title":"On the equivalence, containment, and covering problems for the regular and context-free languages","volume":"12","author":"Hunt","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(80)90043-2_BIB6","series-title":"The Art of Computer Programming I: Fundamental Algorithms","author":"Knuth","year":"1968"},{"key":"10.1016\/0304-3975(80)90043-2_BIB7","first-page":"254","article-title":"Lower bounds for natural proof systems","author":"Kozen","year":"1977","journal-title":"Proc. 18th IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(80)90043-2_BIB8","doi-asserted-by":"crossref","first-page":"315","DOI":"10.4064\/aa-14-3-315-332","article-title":"Sur l'ordre maximum d'un \u00e9l\u00e9ment dans le groupe Sn des permutations","volume":"14","author":"Nicolas","year":"1968","journal-title":"Acta Arith."},{"key":"10.1016\/0304-3975(80)90043-2_BIB9","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF00288886","article-title":"Data encodings and their costs","volume":"9","author":"Rosenberg","year":"1978","journal-title":"Acta Informat."},{"key":"10.1016\/0304-3975(80)90043-2_BIB10","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/322154.322160","article-title":"Encoding data structures in trees","volume":"26","author":"Rosenberg","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(80)90043-2_BIB11","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF01776564","article-title":"Bounds on the costs of data encodings","volume":"12","author":"Rosenberg","year":"1978","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(80)90043-2_BIB12","series-title":"Report RC-7204","article-title":"Uniform data encodings","author":"Rosenberg","year":"1978"},{"key":"10.1016\/0304-3975(80)90043-2_BIB13","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationships between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(80)90043-2_BIB14","article-title":"A view of logical data organization and its mapping to physical storage","author":"Scheuermann","year":"1974","journal-title":"Proc. 3rd Texas Conference on Computing Systems"},{"key":"10.1016\/0304-3975(80)90043-2_BIB15","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF00991070","article-title":"Toward a theory of encoded data structures and data translation","volume":"5","author":"Shneiderman","year":"1976","journal-title":"Internat. J. Comput. Information Sci."},{"key":"10.1016\/0304-3975(80)90043-2_BIB16","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/BF01932155","article-title":"Pyramids: a data type for matrix representation in Pascal","volume":"17","author":"Solntseff","year":"1977","journal-title":"BIT"},{"key":"10.1016\/0304-3975(80)90043-2_BIB17","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(80)90043-2_BIB18","article-title":"Uber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen","author":"Thue","year":"1913","journal-title":"Mat. Nat. Klasse 1"},{"key":"10.1016\/0304-3975(80)90043-2_BIB19","series-title":"Graphs, Groups, and Surfaces","author":"White","year":"1973"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900432?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900432?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T12:50:55Z","timestamp":1583931055000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397580900432"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,6]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1980,6]]}},"alternative-id":["0304397580900432"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(80)90043-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1980,6]]}}}