{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:29:05Z","timestamp":1742401745555},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540108436"},{"type":"electronic","value":"9783540387459"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10843-2_3","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T12:28:34Z","timestamp":1330172914000},"page":"29-40","source":"Crossref","is-referenced-by-count":9,"title":["Area-time optimal VLSI networks for computing integer multiplication and Discrete Dourier Transform"],"prefix":"10.1007","author":[{"given":"F. P.","family":"Preparata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. E.","family":"Vuillemin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"3_CR1","unstructured":"C. Mead and L. Conway, Introduction to VLSI Systems, Addison-Wesley, Reading, Mass., 1979."},{"key":"3_CR2","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"},{"key":"3_CR3","volume-title":"A complexity theory for VLSI","author":"C. D. Thompson","year":"1980","unstructured":"C. D. Thompson, \"A complexity theory for VLSI,\" Ph.D. Thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, Penn., 1980."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"R. P. Brent and H. T. Kung, \"The chip complexity of binary arithmetic,\" Proc. of 12th ACM Symposium on Theory of Computing, (Los Angeles), pp. 190\u2013200, May 1980.","DOI":"10.1145\/800141.804666"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"J. E. Vuillemin, \"A combinatorial limit to the computing power of VLSI circuits,\" Proc. 21st Symposium on Foundation of Computer Science, (Syracuse), pp. 294\u2013300, Oct., 1980.","DOI":"10.1109\/SFCS.1980.1"},{"issue":"1","key":"3_CR6","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/358808.358814","volume":"23","author":"H. Abelson","year":"1980","unstructured":"H. Abelson and P. Andreae, \"Information transfer and area-time trade-offs for VLSI multiplication,\" Communications of the ACM, vol. 23, n. 1, pp. 20\u201322; January, 1980.","journal-title":"Communications of the ACM"},{"key":"3_CR7","unstructured":"H. T. Kung and C. E. Leiserson, \"Algorithms for VLSI processor arrays,\" Symposium on Sparse Matrix Computations, Knoxville, Tenn., Nov. 1978."},{"key":"3_CR8","unstructured":"L. J. Guibas, H. T. Kung, and C. D. Thompson, \"Direct VLSI implementation of combinatorial algorithms,\" Proc. Conference on VLSI Architecture, Design, Fabrication, Calif. Inst. of Techn., January 1979."},{"key":"3_CR9","unstructured":"J. E. Savage, \"Area-time tradeoffs for matrix multiplication and transitive closure in the VLSI model,\" Proc. of the 17th Annual Allerton Conference on Communications, Control, and Computing, October 1979."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"F. P. Preparata and J. Vuillemin, \"The cube-connected-cycles: a versatile network for parallel computation,\" (Extended Abstract), Proceedings of 20-th Annual IEEE Symposium on Foundations of Computer Science, Puerto Rico, October 1979.","DOI":"10.1109\/SFCS.1979.43"},{"issue":"2","key":"3_CR11","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 networks for multiplying matrices,\" Information Processing Letters, vol. 11, n. 2, pp. 77\u201380, October 1980.","journal-title":"Information Processing Letters"},{"key":"3_CR12","unstructured":"F. P. Preparata and J. Vuillemin, \"Optimal integrated-circuit implementation of triangular matrix inversion,\" 1980 International Conference on Parallel Processing, Boyne, Mich., pp. 211\u2013216, Aug. 1980."},{"key":"3_CR13","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, vol. C-20, pp. 153\u2013161; 1971.","journal-title":"IEEE Transactions on Computers"},{"key":"3_CR14","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"A. Sch\u00f6nhage and V. Strassen, \"Schnelle Multiplikation grosser Zahlen,\" Computing, vol. 7, pp. 281\u2013292; 1971.","journal-title":"Computing"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10843-2_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:03:38Z","timestamp":1605625418000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10843-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540108436","9783540387459"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-10843-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}