{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:33:04Z","timestamp":1725456784752},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540615491"},{"type":"electronic","value":"9783540688082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0030109","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:38:48Z","timestamp":1133397528000},"page":"195-200","source":"Crossref","is-referenced-by-count":1,"title":["A regular VLSI array for an irregular algorithm"],"prefix":"10.1007","author":[{"given":"Florent","family":"de Dinechin","sequence":"first","affiliation":[]},{"given":"Doran K.","family":"Wilde","sequence":"additional","affiliation":[]},{"given":"Sanjay","family":"Rajopadhye","sequence":"additional","affiliation":[]},{"given":"Rumen","family":"Andonov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"16_CR1","unstructured":"R. Andonov, F. de Dinechin, S. Rajopadhye, and D. Wilde.-Systematic design of wavefront array processors: A case study.-Internal Report 743, IRISA, March 1994."},{"key":"16_CR2","unstructured":"R. Andonov and S. Rajopadhye.-An optimal algo-tech-cuit for the knapsack problem.-Technical Report PI-791, IRISA, January 1994.-(to appear in IEEE Transactions on Parallel and Distributed Systems)."},{"key":"16_CR3","first-page":"302","volume-title":"A sparse knapsack algo-tech-cuit and its synthesis","author":"R. Andonov","year":"1994","unstructured":"R. Andonov and S. V. Rajopadhye.-A sparse knapsack algo-tech-cuit and its synthesis.-In International Conference on Application-Specific Array Processors (ASAP-94), pages 302\u2013313, San Francisco, August 1994. IEEE."},{"key":"16_CR4","volume-title":"Dynamic Programming","author":"R. Bellman","year":"1957","unstructured":"R. Bellman.-Dynamic Programming.-Princeton University Press, Princeton, NJ, 1957."},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1016\/0167-8191(92)90047-B","volume":"18","author":"G.H. Chen","year":"1992","unstructured":"G.H. Chen and J.H. Jang.-An improved parallel algorithm for 0\/1 knapsack problem.-Parallel Computing, 18:811\u2013821, 1992.","journal-title":"Parallel Computing"},{"issue":"2","key":"16_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1145\/321812.321823","volume":"21","author":"E. Horowitz","year":"1974","unstructured":"E. Horowitz and S. Sahni.-Computing partitions with aplications to the knapsack problem.-Journal of the ACM, 21(2):277\u2013292, April 1974.","journal-title":"Journal of the ACM"},{"key":"16_CR7","unstructured":"T. C. Hu.-Integer Programming and Network Flows.-Addison-Wesley, 1969."},{"key":"16_CR8","unstructured":"G. Kahn.-The semantics of a simple language for parallel processing.-In Proceedings of IFIP, pages 471\u2013475. IFIP, August 1974."},{"key":"16_CR9","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1109\/TC.1982.1675922","volume":"C-31","author":"S. Y. Kung","year":"1982","unstructured":"S. Y. Kung, K. S. Arun, R. J. Gal-Ezer, and D. V. B. Rao.-Wavefront array processor: Language, architecture and applications.-IEEE Transactions on Computers, C-31:1054\u20131066, 1982.","journal-title":"IEEE Transactions on Computers"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/0743-7315(88)90007-X","volume":"5","author":"J. Lee","year":"1988","unstructured":"J. Lee, E. Shragowitz, and S. Sahni.-A hypercube algorithm for the 0\/1 knapsack problems.-J. of Parallel and Distributed Computing, 5:438\u2013456, 1988.","journal-title":"J. of Parallel and Distributed Computing"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/0743-7315(91)90080-S","volume":"13","author":"J. Lin","year":"1991","unstructured":"J. Lin and J. A. Storer.-Processor-efficient hypercube algorithm for the knapsack problem.-J. of Parallel and Distributed Computing, 13:332\u2013337, 1991.","journal-title":"J. of Parallel and Distributed Computing"},{"key":"16_CR12","unstructured":"S. Martello and P. Toth.-Knapsack Problems: Algorithms and Computer Implementation.-John Wiley and Sons, 1990."},{"issue":"9","key":"16_CR13","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1287\/mnsc.15.9.494","volume":"15","author":"G. Nemhauser","year":"1969","unstructured":"G. Nemhauser and J. Ullman.-Discrete dynamic programming and capital allocation.-Management Science, 15(9):494\u2013505, 1969.","journal-title":"Management Science"}],"container-title":["Lecture Notes in Computer Science","Parallel Algorithms for Irregularly Structured Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030109","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T23:25:40Z","timestamp":1549409140000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615491","9783540688082"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0030109","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}