{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T09:04:14Z","timestamp":1762160654288},"reference-count":17,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[1983,2,1]],"date-time":"1983-02-01T00:00:00Z","timestamp":412905600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1983,2]]},"DOI":"10.1109\/tc.1983.1676203","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T16:35:10Z","timestamp":1188923710000},"page":"194-198","source":"Crossref","is-referenced-by-count":28,"title":["A Mesh-Connected Area-Time Optimal VLSI Multiplier of Large Integers"],"prefix":"10.1109","volume":"C-32","author":[{"family":"Preparata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/358808.358814"},{"key":"ref11","first-page":"300","article-title":"the cube-connected-cycles: a versatile network for parallel computation","volume":"24","author":"preparata","year":"1981","journal-title":"Commun Ass Comput Mach"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802485"},{"key":"ref13","author":"oppenheim","year":"1975","journal-title":"Digital Signal Processing"},{"key":"ref14","author":"muller","year":"1963","journal-title":"Switching Theory in Space Technology"},{"key":"ref15","first-page":"139","article-title":"on the least prime in an arithmetic progression: i: the basic theorem","volume":"15","author":"linnik","year":"1944","journal-title":"Rec Math"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1090\/S0025-5718-1979-0528061-7","article-title":"greatest and least primes in arithmetic progressions having a given modulus","volume":"33","author":"wagstaff","year":"1979","journal-title":"Math Comput"},{"key":"ref17","author":"dickson","year":"1957","journal-title":"Introduction to the Theory of Numbers"},{"key":"ref4","first-page":"29","article-title":"area-time optimal vlsi networks for computing integer multiplication and discrete fourier transform","author":"preparata","year":"1981","journal-title":"Proc ICALP"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/322261.322269"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804401"},{"key":"ref5","author":"mead","year":"1979","journal-title":"Introduction to VLSI Systems"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1980.1"},{"key":"ref7","author":"thompson","year":"1980","journal-title":"A Complexity Theory for VLSI"},{"key":"ref2","author":"knuth","year":"1969","journal-title":"The Art of Computer Programming Vol 2 Seminumerical Algorithms"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02242355"},{"key":"ref9","year":"0","journal-title":"IEEE Trans Comput"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/35224\/01676203.pdf?arnumber=1676203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T15:40:04Z","timestamp":1638200404000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1676203\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,2]]},"references-count":17,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tc.1983.1676203","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"value":"0018-9340","type":"print"},{"value":"1557-9956","type":"electronic"},{"value":"2326-3814","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,2]]}}}