{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:10:44Z","timestamp":1759133444939},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1016\/0167-8191(94)90083-3","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"233-243","source":"Crossref","is-referenced-by-count":15,"title":["A parallel algorithm for the knapsack problem using a generation and searching technique"],"prefix":"10.1016","volume":"20","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"}]},{"given":"Shyong-Jian","family":"Shyu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(94)90083-3_BIB1","series-title":"The Design and Analysis of Parallel Algorithms","author":"Akl","year":"1989"},{"key":"10.1016\/0167-8191(94)90083-3_BIB2","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1109\/18.6030","article-title":"Time-memory-processor trade-offs","volume":"IT-34","author":"Amirazizi","year":"1988","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/0167-8191(94)90083-3_BIB3","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0167-8191(89)90121-X","article-title":"The two list algorithm for the knapsack problem on a FPS T20","author":"Cosnard","year":"1989","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(94)90083-3_BIB4","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","article-title":"New directions in cryptography","volume":"IT-22","author":"Diffie","year":"1976","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/0167-8191(94)90083-3_BIB5","series-title":"Parallel Processing","first-page":"169","article-title":"Efficient parallel algorithm for the knapsack problem","author":"Ferreira","year":"1988"},{"key":"10.1016\/0167-8191(94)90083-3_BIB6","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1109\/12.73593","article-title":"A parallel time\/hardware tradeoff T\u2217H = O(2n2) for the knapsack problem","volume":"40","author":"Ferreira","year":"1991","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(94)90083-3_BIB7","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/321812.321823","article-title":"Computing partitions with applications to the knapsack problem","volume":"21","author":"Horowitz","year":"1974","journal-title":"J. Ass. Comput. Mach."},{"key":"10.1016\/0167-8191(94)90083-3_BIB8","series-title":"Fundamentals of Computer Algorithms","author":"Horowitz","year":"1978"},{"key":"10.1016\/0167-8191(94)90083-3_BIB9","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1109\/TC.1984.1676456","article-title":"A parallel algorithm for the knapsack problem","volume":"C-33","author":"Karnin","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(94)90083-3_BIB10","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","article-title":"Hiding information and signature in Trapdoor knapsack","volume":"IT-24","author":"Merkle","year":"1978","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/0167-8191(94)90083-3_BIB11","first-page":"465","article-title":"On the security of multiple encryption","volume":"24","author":"Merkle","year":"1981","journal-title":"Comm. Ass. Compu. Mach."},{"key":"10.1016\/0167-8191(94)90083-3_BIB12","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/2.55467","article-title":"The Monarch parallel processor hardware design","author":"Rettberg","year":"1990","journal-title":"IEEE Comput."},{"key":"10.1016\/0167-8191(94)90083-3_BIB13","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1137\/0210033","article-title":"A T = O(2n2), S = O(2n4) algorithm for certain NP-complete problems","volume":"10","author":"Schroeppel","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-8191(94)90083-3_BIB14","series-title":"Proc. 11th Annual ACM Symp. on the Theory of Computing","first-page":"118","article-title":"On the cryptocomplexity of knapsack systems","author":"Shamir","year":"1979"},{"key":"10.1016\/0167-8191(94)90083-3_BIB15","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1109\/TIT.1984.1056964","article-title":"A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem","volume":"IT-30","author":"Shamir","year":"1984","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819194900833?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819194900833?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:28:23Z","timestamp":1551086903000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819194900833"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["0167819194900833"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(94)90083-3","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}