{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T18:12:46Z","timestamp":1697825566595},"reference-count":16,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[1984,5,1]],"date-time":"1984-05-01T00:00:00Z","timestamp":452217600000},"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":[[1984,5]]},"DOI":"10.1109\/tc.1984.1676463","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T20:35:10Z","timestamp":1188938110000},"page":"455-462","source":"Crossref","is-referenced-by-count":1,"title":["Area-Time Optimal Fast Implementation of Several Functions in a VLSI Model"],"prefix":"10.1109","volume":"C-33","author":[{"family":"Wada","sequence":"first","affiliation":[]},{"family":"Hagihara","sequence":"additional","affiliation":[]},{"family":"Tokura","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1977.1674846"},{"key":"ref11","first-page":"676","article-title":"the area-time complexity of n variables logical functions","volume":"j64 d","author":"wada","year":"1981","journal-title":"Trans IECE Japan"},{"key":"ref12","article-title":"the area-time tradeoffs for vlsi circuits","author":"wada","year":"1981","journal-title":"Papers of Tech Group on Electron Comput"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/scj.4690170608"},{"key":"ref14","article-title":"area and time complexities of vlsi computations","author":"wada","year":"1982","journal-title":"Proc 7th IBM Symp on Math Foundation of Comput Sci Math Theory of Computations"},{"key":"ref15","article-title":"on embedding problems of logic circuits in a vlsi model","author":"yasuura","year":"1981","journal-title":"Papers of Tech Group on Automat and Lang"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1981.26"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802482"},{"key":"ref3","author":"kung","year":"1979","journal-title":"Let's design algorithms for VLSI systems"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/321879.321882"},{"key":"ref5","author":"mead","year":"1979","journal-title":"Introduction to VLSI Systems"},{"key":"ref8","author":"savage","year":"1979","journal-title":"Area-time tradeoffs for matrix multiplication and related problems in VLSI models"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(80)90006-X"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(80)90010-1"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/800141.804666"},{"key":"ref9","author":"thompson","year":"1980","journal-title":"complexity theory for VLSI"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/35238\/01676463.pdf?arnumber=1676463","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:40:10Z","timestamp":1638218410000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1676463\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,5]]},"references-count":16,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tc.1984.1676463","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[1984,5]]}}}