{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T22:25:01Z","timestamp":1648938301662},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Languages"],"published-print":{"date-parts":[[1982,1]]},"DOI":"10.1016\/0096-0551(82)90020-0","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T23:11:16Z","timestamp":1060297876000},"page":"41-52","source":"Crossref","is-referenced-by-count":1,"title":["Optimal code from flow graphs"],"prefix":"10.1016","volume":"7","author":[{"given":"M.V.S.","family":"Ramanath","sequence":"first","affiliation":[]},{"given":"Marvin","family":"Solomon","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0096-0551(82)90020-0_BIB1","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/953411.953412","article-title":"The best simple code generation technique for WHILE, FOR, and DO loops","volume":"13","author":"Baskett","year":"1978","journal-title":"Sigplan Notices"},{"key":"10.1016\/0096-0551(82)90020-0_BIB2","first-page":"199","article-title":"The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound 2","volume":"8","author":"Plesnik","year":"1979"},{"issue":"3","key":"10.1016\/0096-0551(82)90020-0_BIB3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1145\/321832.321835","article-title":"Characterizations of reducible flow graphs","volume":"21","author":"Hecht","year":"1974","journal-title":"J. Am. Comput. Mach."},{"key":"10.1016\/0096-0551(82)90020-0_BIB4","series-title":"Flow Analysis of Computer Programs","author":"Hecht","year":"1977"},{"issue":"2","key":"10.1016\/0096-0551(82)90020-0_BIB5","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1145\/322003.322005","article-title":"Covering the points of a digraph with point-disjoint paths and its application to code optimization","volume":"24","author":"Boesch","year":"1977","journal-title":"J. Am. Comput. Mach."},{"issue":"4","key":"10.1016\/0096-0551(82)90020-0_BIB6","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n5 2 algorithm for maximum matchings in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"Siam J. Comput."},{"issue":"5","key":"10.1016\/0096-0551(82)90020-0_BIB7","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/359460.359474","article-title":"Assembling code for machines with span-dependent instructions","volume":"21","author":"Szymanski","year":"1978","journal-title":"CACM"},{"issue":"10","key":"10.1016\/0096-0551(82)90020-0_BIB8","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/956020.956021","article-title":"Can structured programs be efficient?","volume":"11","author":"DeMillo","year":"1976","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/0096-0551(82)90020-0_BIB9","series-title":"Ninth ACM Symposium on Principles of Programming Languages","article-title":"Optimal code generation for control structures","author":"Ramanath","year":"1982"}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055182900200?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055182900200?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T09:22:56Z","timestamp":1552641776000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0096055182900200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,1]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,1]]}},"alternative-id":["0096055182900200"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(82)90020-0","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[1982,1]]}}}