{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T23:06:59Z","timestamp":1649113619804},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. High Speed Comp."],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1142\/s0129053392000043","type":"journal-article","created":{"date-parts":[[2004,11,24]],"date-time":"2004-11-24T19:50:24Z","timestamp":1101325824000},"page":"109-120","source":"Crossref","is-referenced-by-count":0,"title":["A PARALLEL ALGORITHM FOR THE KNAPSACK PROBLEM WITH MEMORY\/PROCESSOR TRADEOFF M<sup>2<\/sup>P = O(2<sup>n\/2<\/sup>)"],"prefix":"10.1142","volume":"04","author":[{"given":"HENRY KER-CHANG","family":"CHANG","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JONATHAN JEN-RONG","family":"CHEN","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","container-title":["International Journal of High Speed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129053392000043","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T23:17:59Z","timestamp":1480634279000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129053392000043"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":0,"journal-issue":{"issue":"02","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["10.1142\/S0129053392000043"],"URL":"https:\/\/doi.org\/10.1142\/s0129053392000043","relation":{},"ISSN":["0129-0533"],"issn-type":[{"value":"0129-0533","type":"print"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}