{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T20:10:17Z","timestamp":1649016617970},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"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,7]]},"DOI":"10.1016\/0096-0551(95)00005-o","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:56:11Z","timestamp":1027652171000},"page":"113-127","source":"Crossref","is-referenced-by-count":0,"title":["Generating optimal contiguous evaluations for expression DAGs"],"prefix":"10.1016","volume":"21","author":[{"given":"Christoph W.","family":"Ke\u03b2ler","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Rauber","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0096-0551(95)00005-O_BIB1","year":"1991"},{"key":"10.1016\/0096-0551(95)00005-O_BIB2","series-title":"Code Generation\u2014Concepts, Tools, Techniques","article-title":"Scheduling vector straight line code on vector processors","author":"Ke\u03b2ler","year":"1992"},{"key":"10.1016\/0096-0551(95)00005-O_BIB3","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1002\/spe.4380090307","article-title":"Unrolling loops in Fortran","volume":"9","author":"Dongarra","year":"1979","journal-title":"Software Pract. Exper."},{"key":"10.1016\/0096-0551(95)00005-O_BIB4","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1109\/TC.1981.1675827","article-title":"Trace scheduling: a technique for global microcode compactin","volume":"C-30","author":"Fisher","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0096-0551(95)00005-O_BIB5","series-title":"ACM International Conference on Supercomputing","first-page":"442","article-title":"Code scheduling and register allocation in large basic blocks","author":"Goodman","year":"1988"},{"key":"10.1016\/0096-0551(95)00005-O_BIB6","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0096-0551(81)90048-5","article-title":"Register allocation via coloring","volume":"6","author":"Chaitin","year":"1981","journal-title":"Comput. Lang."},{"key":"10.1016\/0096-0551(95)00005-O_BIB7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/872726.806984","article-title":"Register allocation & spilling via graph coloring","volume":"17","author":"Chaitin","year":"1982","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/0096-0551(95)00005-O_BIB8","author":"Aho","year":"1986"},{"key":"10.1016\/0096-0551(95)00005-O_BIB9","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1145\/321607.321620","article-title":"The generation of optimal code for arithmetic expressions","volume":"Vol. 17","author":"Sethi","year":"1970","journal-title":"J. ACM"},{"key":"10.1016\/0096-0551(95)00005-O_BIB10","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1137\/0204020","article-title":"Computer register allocation problems","volume":"4","author":"Sethi","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0096-0551(95)00005-O_BIB11","first-page":"195","article-title":"A randomized heuristic approach to register allocation","volume":"Vol. 528","author":"Ke\u03b2ler","year":"1991"},{"key":"10.1016\/0096-0551(95)00005-O_BIB12","author":"Mehlhorn","year":"1984","journal-title":"Data Structures and Algorithms 2: Graph Algorithms and N P-Completeness"},{"key":"10.1016\/0096-0551(95)00005-O_BIB13","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1145\/321958.321970","article-title":"Optimal code generation for expression trees","volume":"23","author":"Aho","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0096-0551(95)00005-O_BIB14","series-title":"Proceedings of the ISMM International Conference on Parallel and Distributed Computing and Systems","first-page":"97","article-title":"An optimizing compiler for vector processors","author":"Rauber","year":"1990"}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009605519500005O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009605519500005O?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:37Z","timestamp":1555210657000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009605519500005O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["009605519500005O"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(95)00005-o","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}