{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T17:51:54Z","timestamp":1648576314749},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,4,1]],"date-time":"1995-04-01T00:00:00Z","timestamp":796694400000},"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":[[1995,4]]},"DOI":"10.1016\/0096-0551(95)00001-k","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:56:11Z","timestamp":1027652171000},"page":"49-65","source":"Crossref","is-referenced-by-count":4,"title":["Scheduling expression trees with reusable registers on delayed-load architectures"],"prefix":"10.1016","volume":"21","author":[{"given":"R.","family":"Venugopal","sequence":"first","affiliation":[]},{"given":"Y.N.","family":"Srikant","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0096-0551(95)00001-K_BIB1","series-title":"Proceedings of the ACM SIGPLAN '91 Conference on Programming Languages Design and Implementation","first-page":"256","article-title":"Linear-time, optimal code scheduling for delayed-load architectures","author":"Proebsting","year":"1991"},{"key":"10.1016\/0096-0551(95)00001-K_BIB2","article-title":"Instruction scheduling for RISC processors","author":"Venugopal","year":"1991"},{"key":"10.1016\/0096-0551(95)00001-K_BIB3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1287\/opre.26.1.141","article-title":"Scheduling to minimize maximum cumulative cost subject to series-parallel constraints","volume":"26","author":"Abdel Wahab","year":"1978","journal-title":"Opns Res."},{"key":"10.1016\/0096-0551(95)00001-K_BIB4","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1137\/0218074","article-title":"Scheduling arithmetic and load operations in parallel with no spilling","volume":"18","author":"Bernstein","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0096-0551(95)00001-K_BIB5","doi-asserted-by":"crossref","first-page":"1308","DOI":"10.1109\/12.29469","article-title":"On the complexity of scheduling problems for parallel\/pipelined machines","volume":"38","author":"Bernstein","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0096-0551(95)00001-K_BIB6","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1145\/321607.321620","article-title":"The generation of optimal code for arithmetic expressions","volume":"17","author":"Sethi","year":"1970","journal-title":"J. ACM"}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009605519500001K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009605519500001K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T02:57:36Z","timestamp":1555210656000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009605519500001K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,4]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,4]]}},"alternative-id":["009605519500001K"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(95)00001-k","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[1995,4]]}}}