{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:17:35Z","timestamp":1725455855650},"publisher-location":"Berlin\/Heidelberg","reference-count":6,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354010576X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017303","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:22:34Z","timestamp":1132644154000},"page":"109-122","source":"Crossref","is-referenced-by-count":1,"title":["Erzeugung optimalen Codes f\u00fcr Series \u2014 Parallel Graphs"],"prefix":"10.1007","author":[{"given":"Reiner","family":"G\u00fcttler","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/321958.321970","volume":"23","author":"A.V. Aho","year":"1976","unstructured":"A.V. Aho and S.C. Johnson \u201cOptimal code generation for expression trees\u201d, JACM 23, 3 (July 1976)","journal-title":"JACM"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321992.322001","volume":"24","author":"A.V. Aho","year":"1977","unstructured":"A.V. Aho, S.C. Johnson and J.D. Ullman \u201cCode generation for expressions with common subexpressions\u201d, JACM 24, 1 (Jan. 1977)","journal-title":"JACM"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"A.V. Aho and R. Sethi \u201cHow hard is compiler code generation\u201d, Lecture Notes in Computer Science 52 (1977)","DOI":"10.1007\/3-540-08342-1_1"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/321958.321970","volume":"23","author":"J. Bruno","year":"1976","unstructured":"J. Bruno and R. Sethi \u201cCode generation for a one-register machine\u201d, JACM 23, 3 (July 1976)","journal-title":"JACM"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"B. Prabhala and R. Sethi \u201cEfficient computation of expressions with common subexpressions\u201d, V. ACM Symp. on POPL (Jan. 1978)","DOI":"10.1145\/512760.512784"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/321607.321620","volume":"17","author":"R. Sethi","year":"1970","unstructured":"R. Sethi and J.D. Ullman \u201cThe generation of optimal code for arithmetic expressions\u201d, JACM 17, 4 (Oct. 1970)","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017303.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:38:09Z","timestamp":1607549889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354010576X"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/bfb0017303","relation":{},"subject":[]}}