{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T08:32:39Z","timestamp":1648974759002},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1974,12,1]],"date-time":"1974-12-01T00:00:00Z","timestamp":155088000000},"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":[[1974,12]]},"DOI":"10.1007\/bf01780582","type":"journal-article","created":{"date-parts":[[2005,6,19]],"date-time":"2005-06-19T23:43:37Z","timestamp":1119224617000},"page":"353-367","source":"Crossref","is-referenced-by-count":3,"title":["Generalized addressing schemes for data graphs"],"prefix":"10.1007","volume":"8","author":[{"given":"Arnold L.","family":"Rosenberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01780582_CR1","series-title":"Mathematical Surveys","volume-title":"The Algebraic Theory of Semigroups I","author":"A. H. Clifford","year":"1961","unstructured":"A. H. Clifford andG. B. Preston,The Algebraic Theory of Semigroups I, Mathematical Surveys No. 7, Amer. Math. Soc., Providence, R.I., 1961."},{"key":"BF01780582_CR2","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, Mass., 1968."},{"key":"BF01780582_CR3","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0022-0000(71)80034-X","volume":"5","author":"A. L. Rosenberg","year":"1971","unstructured":"A. L. Rosenberg, Data graphs and addressing schemes,J. Comput. System Sci. 5 (1971), 193\u2013238.","journal-title":"J. Comput. System Sci."},{"key":"BF01780582_CR4","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/321694.321703","volume":"19","author":"A. L. Rosenberg","year":"1972","unstructured":"A. L. Rosenberg, Addressable data graphs,J. Assoc. Comput. Mach.. 19 (1972), 309\u2013340.","journal-title":"J. Assoc. Comput. Mach.."},{"key":"BF01780582_CR5","series-title":"Courant Computer Science Symposium","first-page":"161","volume-title":"Computational Complexity","author":"A. L. Rosenberg","year":"1973","unstructured":"A. L. Rosenberg, Exploiting addressability in data graphs, inComputational Complexity (R. Rustin, ed.), Courant Computer Science Symposium 7, Algorithmics Press, New York, 1973, pp. 161\u2013183."},{"key":"BF01780582_CR6","unstructured":"A. L. Rosenberg, Quasi-addressable data graphs, IBM Report RC-3742, 1972."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01780582.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01780582\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01780582","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T13:21:13Z","timestamp":1557408073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01780582"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,12]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1974,12]]}},"alternative-id":["BF01780582"],"URL":"https:\/\/doi.org\/10.1007\/bf01780582","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974,12]]}}}