{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:14:17Z","timestamp":1725459257234},"publisher-location":"Berlin\/Heidelberg","reference-count":10,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540133720"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0030295","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T10:19:29Z","timestamp":1138184369000},"page":"149-161","source":"Crossref","is-referenced-by-count":2,"title":["VLSI algorithms and architectures"],"prefix":"10.1007","author":[{"given":"Franco P.","family":"Preparata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974."},{"issue":"3","key":"10_CR2","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1145\/322261.322269","volume":"28","author":"R. P. Brent","year":"1981","unstructured":"R. P. Brent and H. T. Kung, \"The chip complexity of binary arithmetic,\" Journal of the ACM, vol. 28, n. 3, pp. 521\u2013534, July 1981.","journal-title":"Journal of the ACM"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"C. D. Thompson, \"Area-time complexity for VLSI,\" Proc. of the 11th Annual ACM Symposium on the Theory of Computing (SIGACT), pp. 81\u201388, May 1979.","DOI":"10.1145\/800135.804401"},{"issue":"3","key":"10_CR4","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1109\/TC.1983.1676221","volume":"C-32","author":"J. E. Vuillemin","year":"1983","unstructured":"J. E. Vuillemin, \"A combinatorial limit to the computing power of VLSI circuits,\" IEEE Transactions on Computers, C-32, n. 3, pp. 294\u2013300, March 1983.","journal-title":"IEEE Transactions on Computers"},{"issue":"5","key":"10_CR5","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","volume":"24","author":"F. P. Preparata","year":"1981","unstructured":"F. P. Preparata and J. Vuillemin, \"The cube-connected-cycles: a versatile network for parallel computation,\" Communications of the ACM, vol. 24, n. 5, pp. 300\u2013309, May 1981.","journal-title":"Communications of the ACM"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"F. P. Preparata and J. Vuillemin, \"Area-time optimal VLSI networks for computing integer multiplication and Discrete Fourier Transform,\" Proc. of I.C.A.L.P., Acre, Israel, pp. 29\u201340, June 1981.","DOI":"10.1007\/3-540-10843-2_3"},{"issue":"2","key":"10_CR7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","volume":"C-20","author":"H. S. Stone","year":"1971","unstructured":"H. S. Stone, \"Parallel processing with the perfect shuffle,\" IEEE Transactions on Computers, C-20, n. 2, pp. 153\u2013161, February 1971.","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"10_CR8","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0022-0000(83)90005-3","volume":"26","author":"D. Kleitman","year":"1983","unstructured":"D. Kleitman, et al., \"An asymptotically optimal layout for the shuffle-exchange graph,\" J. of Comp. and Syst. Sci., vol. 26, n. 3, pp. 339\u2013361, June 1983.","journal-title":"J. of Comp. and Syst. Sci."},{"issue":"2","key":"10_CR9","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0020-0190(80)90006-X","volume":"11","author":"F. P. Preparata","year":"1980","unstructured":"F. P. Preparata and J. Vuillemin, \"Area-time optimal VLSI network for multiplying matrices,\" Information Processing Letters, vol. 11, n. 2, pp. 77\u201380, October 1980.","journal-title":"Information Processing Letters"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"G. Bilardi and F. P. Preparata, \"An architecture for bitonic sorting with optimal VLSI performance,\" IEEE Transactions on Computers, to appear (May 1984).","DOI":"10.1109\/TC.1984.5009338"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1984"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030295.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T17:00:54Z","timestamp":1607533254000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030295"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540133720"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0030295","relation":{},"subject":[]}}