{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T06:13:27Z","timestamp":1673590407659},"reference-count":0,"publisher":"Oxford University Press (OUP)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2010,7,1]]},"DOI":"10.1093\/comjnl\/bxp056","type":"journal-article","created":{"date-parts":[[2009,6,9]],"date-time":"2009-06-09T23:38:18Z","timestamp":1244590698000},"page":"717-740","source":"Crossref","is-referenced-by-count":2,"title":["Fine-Grain Register Allocation and Instruction Scheduling in a Reference Flow"],"prefix":"10.1093","volume":"53","author":[{"given":"D.-H.","family":"Kim","sequence":"first","affiliation":[]},{"given":"H.-J.","family":"Lee","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2009,6,9]]},"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/53\/6\/717\/1339648\/bxp056.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T21:01:42Z","timestamp":1503435702000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxp056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,9]]},"references-count":0,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2010,6,25]]},"published-print":{"date-parts":[[2010,7,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxp056","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,9]]}}}