{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:22Z","timestamp":1725662902178},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540133452"},{"type":"electronic","value":"9783540388869"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-13345-3_31","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:03:20Z","timestamp":1330193000000},"page":"347-357","source":"Crossref","is-referenced-by-count":0,"title":["Area-time optimal vlsi integer multiplier with minimum computation time"],"prefix":"10.1007","author":[{"given":"K.","family":"Mehlhorn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F. P.","family":"Preparata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"issue":"1","key":"31_CR1","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, Jan. 1980.","journal-title":"Communications of the ACM"},{"key":"31_CR2","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, Addision-Wesley, Reading, MA, 1974."},{"key":"31_CR3","unstructured":"B. Becker, \"Schnelle Multiplizierwerke f\u00fcr VLSI \u2014 Implementierung,\" Technical Report, Uni. des Saarlandes, 1982."},{"key":"31_CR4","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,\" J. Ass. Comp. Mach., vol. 28, pp. 521\u2013534, July 1981.","journal-title":"J. Ass. Comp. Mach."},{"key":"31_CR5","first-page":"343","volume":"34","author":"L. Dadda","year":"1965","unstructured":"L. Dadda, \"Some schemes for parallel multipliers,\" Alta Frequenza, vol. 34, pp. 343\u2013356, 1965.","journal-title":"Alta Frequenza"},{"key":"31_CR6","first-page":"293","volume":"145","author":"A. Karazuba","year":"1962","unstructured":"A. Karazuba und Y. Ofman, \"Multiplication of multidigit numbers on automata,\" Doklady Akademija Nauk SSSR, vol. 145, pp. 293\u2013294, 1962.","journal-title":"Doklady Akademija Nauk SSSR"},{"key":"31_CR7","unstructured":"Th. Lengauer und K. Mehlhorn, \"VLSI complexity theory, efficient VLSI algorithms and the HILL design system,\" in The International Professorship in Computer Science: Algorithmics for VLSI, Ed. Trullemans, Academic Press, to appear."},{"key":"31_CR8","unstructured":"W. K. Luk and J. E. Vuillemin, \"Recursive implementation of optimal time VLSI integer multipliers,\" VLSI83, Trondheim, Norway, September 1983"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn, AT2-optimal VLSI-circuits for integer division and integer square rooting, submitted for publication.","DOI":"10.1016\/0167-9260(84)90020-8"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"F. P. Preparata and J. Vuillemin, \"Area-time optimal VLSI networks for computing integer multiplication and Discrete Fourier Transform,\" Proceedings of I.C.A.L.P., Haifa, Israel, July 1981, pp. 29\u201340.","DOI":"10.1007\/3-540-10843-2_3"},{"issue":"5","key":"31_CR11","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":"31_CR12","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 7, pp. 281\u2013292, 1971.","journal-title":"Computing"},{"key":"31_CR13","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":"1","key":"31_CR14","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0167-9260(83)90005-6","volume":"1","author":"J. E. Vuillemin","year":"1983","unstructured":"J. E. Vuillemin, \"A very fast multiplication algorithm for VLSI implementation,\" Integration, VLSI Journal, vol. 1, n. 1, pp. 33\u201352, 1983.","journal-title":"Integration, VLSI Journal"},{"issue":"2","key":"31_CR15","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/PGEC.1964.263830","volume":"EC-13","author":"C. S. Wallace","year":"1964","unstructured":"C. S. Wallace, \"A suggestion for a fast multiplier,\" IEEE Transactions on computers, vol. EC-13, n. 2, pp. 14\u201317, 1964.","journal-title":"IEEE Transactions on computers"}],"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-13345-3_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:07:15Z","timestamp":1605643635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13345-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133452","9783540388869"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-13345-3_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]}}}