乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T21:43:22Z","timestamp":1648935802001},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1983,7,1]],"date-time":"1983-07-01T00:00:00Z","timestamp":425865600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T00:00:00Z","timestamp":1373932800000},"content-version":"vor","delay-in-days":10973,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1983,7]]},"DOI":"10.1016\/s0019-9958(83)80061-8","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T22:48:44Z","timestamp":1115419724000},"page":"137-156","source":"Crossref","is-referenced-by-count":26,"title":["Area\u2014Time optimal VLSI integer multiplier with minimum computation time"],"prefix":"10.1016","volume":"58","author":[{"given":"Kurt","family":"Mehlhorn","sequence":"first","affiliation":[]},{"given":"Franco P.","family":"Preparata","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"No. 1","key":"10.1016\/S0019-9958(83)80061-8_bib1","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/358808.358814","article-title":"Information transfer and area-time trade-offs for VLSI multiplication","volume":"23","author":"Abelson","year":"1980","journal-title":"Comm. ACM"},{"key":"10.1016\/S0019-9958(83)80061-8_bib2","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0019-9958(83)80061-8_bib3","article-title":"Schnelle Multiplizierwerke f\u00fcr VLSI\u2014Implementierung","author":"Becker","year":"1982"},{"key":"10.1016\/S0019-9958(83)80061-8_bib4","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1145\/322261.322269","article-title":"The chip complexity of binary arithmetic","volume":"28","author":"Brent","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(83)80061-8_bib5","first-page":"343","article-title":"Some schemes for parallel multipliers","volume":"34","author":"Dadda","year":"1965","journal-title":"Alta Frequenza"},{"key":"10.1016\/S0019-9958(83)80061-8_bib6","first-page":"293","article-title":"Multiplication of multidigit numbers on automata","volume":"145","author":"Karazuba","year":"1962","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/S0019-9958(83)80061-8_bib7","series-title":"The International Professorship in Computer Science: Algorithmics for VLSI","article-title":"VLSI complexity theory, efficient VLSI algorithms and the HILL design system","author":"Lengauer","year":"1983"},{"key":"10.1016\/S0019-9958(83)80061-8_bib8","series-title":"Recursive Implementation of Optimal Time VLSI Integer Multipliers","author":"Luk","year":"1983"},{"key":"10.1016\/S0019-9958(83)80061-8_bib9","series-title":"Switching Theory in Space Technology","article-title":"Asynchronous logic and application to information processing","author":"Muller","year":"1963"},{"issue":"No. 2","key":"10.1016\/S0019-9958(83)80061-8_bib10","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1109\/TC.1983.1676203","article-title":"An area-time optimal mesh-connected multiplier of large integers","volume":"C-32","author":"Preparata","year":"1983","journal-title":"IEEE. Trans. Comput."},{"issue":"No. 5","key":"10.1016\/S0019-9958(83)80061-8_bib11","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","article-title":"The cube-connected-cycles: A versatile network for parallel computation","volume":"24","author":"Preparata","year":"1981","journal-title":"Comm. ACM"},{"key":"10.1016\/S0019-9958(83)80061-8_bib12","series-title":"Proceedings, I.C.A.L.P.","first-page":"29","article-title":"Area-time optimal VLSI networks for computing integer multiplication and discrete Fourier transform","author":"Preparata","year":"1981"},{"key":"10.1016\/S0019-9958(83)80061-8_bib13","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02242355","article-title":"Schnelle Multiplikation grosser Zahlen","volume":"7","author":"Sch\u00f6nhage","year":"1971","journal-title":"Computing"},{"key":"10.1016\/S0019-9958(83)80061-8_bib14","series-title":"Proceedings, 11th Annual ACM Symposium on the Theory of Computing (SIGACT)","first-page":"81","article-title":"Area-time complexity for VLSI","author":"Thompson","year":"1979"},{"issue":"No. 1","key":"10.1016\/S0019-9958(83)80061-8_bib15","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0167-9260(83)90005-6","article-title":"A very fast multiplication algorithm for VLSI implementation","volume":"1","author":"Vuillemin","year":"1983","journal-title":"Integration, VLSI J."},{"issue":"No. 2","key":"10.1016\/S0019-9958(83)80061-8_bib16","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/PGEC.1964.263830","article-title":"A suggestion for a fast multiplier","volume":"EC-13","author":"Wallace","year":"1964","journal-title":"IEEE Trans. Comput."}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995883800618?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995883800618?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T17:27:57Z","timestamp":1548523677000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995883800618"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,7]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1983,7]]}},"alternative-id":["S0019995883800618"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(83)80061-8","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1983,7]]}}}