{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T20:20:21Z","timestamp":1694636421723},"reference-count":13,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[1973,6,1]],"date-time":"1973-06-01T00:00:00Z","timestamp":107740800000},"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":[[1973,6]]},"DOI":"10.1109\/tc.1973.5009105","type":"journal-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T20:36:47Z","timestamp":1243975007000},"page":"552-555","source":"Crossref","is-referenced-by-count":9,"title":["Computation Times of Arithmetic and Boolean Functions in (d, r) Circuits"],"prefix":"10.1109","volume":"C-22","author":[{"given":"Philip M.","family":"Spira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","author":"marques","year":"0"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1961.5219227"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/800169.805441"},{"key":"ref13","author":"kohavi","year":"1970","journal-title":"Switching and Finite Automata Theory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/321264.321279"},{"key":"ref3","author":"winograd","year":"0","journal-title":"On the time required to perform computer operations"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/321510.321515"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1145\/321420.321438","article-title":"on the time required to perform multiplication","volume":"14","author":"winograd","year":"1967","journal-title":"J Ass Comput Mach"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/800169.805443"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223089"},{"key":"ref2","first-page":"293","article-title":"multiplication of multidigit numbers with computers","volume":"145","author":"karatsuba","year":"1962","journal-title":"Dokl Akad Nauk SSSR"},{"key":"ref1","first-page":"48","article-title":"on the algorithmic complexity of discrete functions","volume":"145","author":"ofnian","year":"1962","journal-title":"Dokl Akad Nauk SSSR"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1970.223027"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/5009100\/05009105.pdf?arnumber=5009105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:39:20Z","timestamp":1638218360000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5009105\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973,6]]},"references-count":13,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tc.1973.5009105","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[1973,6]]}}}