{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T21:08:29Z","timestamp":1654117709641},"reference-count":15,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"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":[[1990,12]]},"DOI":"10.1016\/0167-8191(90)90071-g","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"343-350","source":"Crossref","is-referenced-by-count":2,"title":["The vectorization of the partition problem"],"prefix":"10.1016","volume":"16","author":[{"given":"S.J","family":"Shyu","sequence":"first","affiliation":[]},{"given":"R.C.T","family":"Lee","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(90)90071-G_BIB1","series-title":"Cryptography and Data Security","author":"Denning","year":"1982"},{"issue":"4","key":"10.1016\/0167-8191(90)90071-G_BIB2","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1109\/TIT.1984.1056932","article-title":"A critical analysis of the security of knapsack public-key algorithms","volume":"IT-30","author":"Desmedt","year":"1984","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0167-8191(90)90071-G_BIB3","series-title":"Computers and Intractability \u2014 A Guild to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0167-8191(90)90071-G_BIB4","series-title":"Parallel Computers: Architecture, Programming and Algorithms","author":"Hockney","year":"1981"},{"key":"10.1016\/0167-8191(90)90071-G_BIB5","series-title":"Computer Architectures and Parallel Processing","author":"Hwang","year":"1984"},{"key":"10.1016\/0167-8191(90)90071-G_BIB6","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"issue":"1","key":"10.1016\/0167-8191(90)90071-G_BIB7","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","article-title":"A functional equation and its application to resource allocation and sequencing problems","volume":"16","author":"Lawler","year":"1969","journal-title":"Management Sci."},{"issue":"5","key":"10.1016\/0167-8191(90)90071-G_BIB8","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","article-title":"Hiding information and signature in trap-door knapsacks","volume":"IT-24","author":"Merkle","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"10.1016\/0167-8191(90)90071-G_BIB9","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1109\/TC.1987.1676909","article-title":"Vectorization of the calculation of a moving sum","volume":"C-36","author":"Mossberg","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90071-G_BIB10","series-title":"Supercomputer Applications","author":"Numrich","year":"1985"},{"issue":"4","key":"10.1016\/0167-8191(90)90071-G_BIB11","first-page":"595","article-title":"Cryptanalytic attacks on the multiplicative knapsack cryptosystem and Shamir's fast signature scheme","volume":"IT-30","author":"Odlyzko","year":"1984","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0167-8191(90)90071-G_BIB12","series-title":"Parallel Computations","year":"1982"},{"key":"10.1016\/0167-8191(90)90071-G_BIB13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0167-8191(87)90062-7","article-title":"Timing results of some internal sorting algorithms on vector computers","volume":"4","author":"R\u00f6nsch","year":"1987","journal-title":"Parallel Comput."},{"issue":"3","key":"10.1016\/0167-8191(90)90071-G_BIB14","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0167-8191(90)90132-S","article-title":"Solving the set cover problem on a supercomputer","volume":"13","author":"Shyu","year":"1990","journal-title":"Parallel Comput."},{"issue":"2","key":"10.1016\/0167-8191(90)90071-G_BIB15","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1109\/TSE.1978.231484","article-title":"Sorting on STAR","volume":"SE-4","author":"Stone","year":"1978","journal-title":"IEEE Trans. Software Engr."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090071G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090071G?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:26:24Z","timestamp":1551086784000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919090071G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":15,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["016781919090071G"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(90)90071-g","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}