{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:45:41Z","timestamp":1725489941299},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330643"},{"type":"electronic","value":"9783642330650"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33065-0_16","type":"book-chapter","created":{"date-parts":[[2012,9,3]],"date-time":"2012-09-03T17:37:18Z","timestamp":1346693838000},"page":"148-155","source":"Crossref","is-referenced-by-count":3,"title":["A Note on Developing Optimal and Scalable Parallel Two-List Algorithms"],"prefix":"10.1007","author":[{"given":"Fouad B.","family":"Chedid","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","volume-title":"The Design and Analysis of Parallel Algorithms","author":"S.G. Akl","year":"1989","unstructured":"Akl, S.G.: The Design and Analysis of Parallel Algorithms. Prentice-Hall, Englewood Cliffs (1989)"},{"issue":"3","key":"16_CR2","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1109\/18.6030","volume":"34","author":"H.R. Amirazizi","year":"1988","unstructured":"Amirazizi, H.R., Hellman, M.E.: Time Memory Processor trade-offs. IEEE Transactions on Information Theory\u00a034(3), 502\u2013512 (1988)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"16_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0167-8191(94)90083-3","volume":"20","author":"H.K.-C. Chang","year":"1994","unstructured":"Chang, H.K.-C., Chen, J.J.-R., Shyu, S.-J.: A Parallel Algorithm for the Knapsack Problem Using a Generation and Searching Techniques. Parallel Computing\u00a020(2), 233\u2013243 (1994)","journal-title":"Parallel Computing"},{"issue":"1","key":"16_CR4","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.parco.2007.11.001","volume":"34","author":"F.B. Chedid","year":"2008","unstructured":"Chedid, F.B.: An Optimal Parallelization of the Two-List Algorithm of Cost O(2\n                    n\/2). Parallel Computing\u00a034(1), 63\u201365 (2008)","journal-title":"Parallel Computing"},{"key":"16_CR5","unstructured":"Chedid, F.B.: A Scalable Parallelization of the Two-List Algorithm of Optimal Cost O(2\n                    n\/2). In: Proceedings of Algorithms and Complexity in Durham, ACiD 2007, King\u2019s College, London. Texts in Algorithmics, vol.\u00a09, pp. 35\u201342 (2007)"},{"issue":"33","key":"16_CR6","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0167-8191(89)90121-X","volume":"9","author":"M. Cosnard","year":"1989","unstructured":"Cosnard, M., Ferreira, A.G., Herbelin, H.: The Two-List Algorithm for the Knapsack Problem on a FPS T20. Parallel Computing\u00a09(33), 385\u2013388 (1989)","journal-title":"Parallel Computing"},{"issue":"2","key":"16_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1109\/12.73593","volume":"40","author":"A.G. Ferreira","year":"1991","unstructured":"Ferreira, A.G.: A Prallel Time\/Hardware Tradeoff T.H\u2009=\u2009O(2\n                    n\/2) for the Knapsack Problem. IEEE Transactions on Computers\u00a040(2), 221\u2013225 (1991)","journal-title":"IEEE Transactions on Computers"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jpdc.1996.0150","volume":"49","author":"A.G. Ferreira","year":"1996","unstructured":"Ferreira, A.G., Robinson, J.M.: Fast and Scalable Parallel Algorithms for Knapsack-Like Problems. Journal of Parallel and Distributed Computing\u00a049, 1\u201313 (1996)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"16_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"issue":"11","key":"16_CR10","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1016\/j.jpdc.2002.10.001","volume":"64","author":"A. Goldman","year":"2004","unstructured":"Goldman, A., Trystran, D.: An Efficient Parallel Algorithm for Solving the Knapsack Problem on Hypercubes. Journal of Parallel and Distributed Computing\u00a064(11), 1213\u20131222 (2004)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1145\/321812.321823","volume":"21","author":"E. Horowitz","year":"1974","unstructured":"Horowitz, E., Sahni, S.: Computing Partitions With Applications to the Knapsack Problem. Journal of ACM\u00a021(2), 277\u2013292 (1974)","journal-title":"Journal of ACM"},{"issue":"5","key":"16_CR12","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1109\/TC.1984.1676456","volume":"33","author":"E.D. Karnin","year":"1984","unstructured":"Karnin, E.D.: A Parallel Algorithm for the Knapsack Problem. IEEE Transactions on Computers\u00a033(5), 404\u2013408 (1984)","journal-title":"IEEE Transactions on Computers"},{"issue":"6","key":"16_CR13","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1007\/BF02973436","volume":"19","author":"K. Li","year":"2004","unstructured":"Li, K., Li, Q., Hui, W., Jiang, S.: Optimal Parallel Algorithm for the Knapsack Problem Without Memory Conflicts. Journal of Computer Science and Technology\u00a019(6), 760\u2013768 (2004)","journal-title":"Journal of Computer Science and Technology"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1016\/S0167-8191(96)00085-3","volume":"22","author":"D.-C. Lou","year":"1997","unstructured":"Lou, D.-C., Chang, C.-C.: A Parallel Two-List Algorithm for the Knapsack Problem. Parallel Computing\u00a022, 1985\u20131996 (1997)","journal-title":"Parallel Computing"},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1016\/S0167-8191(02)00150-3","volume":"28","author":"C.A.A. Sanches","year":"2002","unstructured":"Sanches, C.A.A., Soma, N.Y., Yanasse, H.H.: Comments on Parallel Algorithms for the Knapsack Problem. Parallel Computing\u00a028, 1501\u20131505 (2002)","journal-title":"Parallel Computing"},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1016\/j.ejor.2005.09.026","volume":"176","author":"C.A.A. Sanches","year":"2007","unstructured":"Sanches, C.A.A., Soma, N.Y., Yanasse, H.H.: An Optimal and Scalable Parallelization of the Two-List Algorithm for the Subset-Sum Problem. European Journal of Operational Research\u00a0176, 870\u2013879 (2007)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33065-0_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:53:55Z","timestamp":1620114835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33065-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330643","9783642330650"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33065-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}