{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T00:06:36Z","timestamp":1759190796562,"version":"3.44.0"},"reference-count":14,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1983,12,1]],"date-time":"1983-12-01T00:00:00Z","timestamp":439084800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1983,12,1]],"date-time":"1983-12-01T00:00:00Z","timestamp":439084800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[1983,12]]},"DOI":"10.1016\/s0167-9260(83)80005-4","type":"journal-article","created":{"date-parts":[[2005,1,5]],"date-time":"2005-01-05T07:28:33Z","timestamp":1104910113000},"page":"317-334","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"title":["An area-time efficient NMOS adder"],"prefix":"10.1016","volume":"1","author":[{"given":"M.A.","family":"Bayoumi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.A.","family":"Jullien","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.C.","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-9260(83)80005-4_bib1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/321264.321279","article-title":"On the time required to perform addition","volume":"12","author":"Winograd","year":"1965","journal-title":"J. ACM"},{"key":"10.1016\/S0167-9260(83)80005-4_bib2","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1109\/T-C.1970.223027","article-title":"On the addition of binary numbers","volume":"C-19","author":"Brent","year":"1970","journal-title":"IEEE Trans. Comput."},{"volume":"Vol. 1","year":"1978","author":"Kuck","key":"10.1016\/S0167-9260(83)80005-4_bib3"},{"issue":"2","key":"10.1016\/S0167-9260(83)80005-4_bib4","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1109\/TEC.1960.5219821","article-title":"An evaluation of several two summand binary adders","volume":"9","author":"Sklansky","year":"1960","journal-title":"Trans. Electronic Comput."},{"key":"10.1016\/S0167-9260(83)80005-4_bib5","first-page":"67","article-title":"High-speed arithmetic in binary computers","volume":"49","author":"MacSorley","year":"1961"},{"key":"10.1016\/S0167-9260(83)80005-4_bib6","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1109\/TC.1976.1674595","article-title":"A survey of some recent contributions to computer arithmetic","volume":"C-25","author":"Garner","year":"1976","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(83)80005-4_bib7","series-title":"Proc. 12th Ann. ACM Symp. on Theory of Computing","first-page":"190","article-title":"The chip complexity of binary arithmetic","author":"Brent","year":"1980"},{"issue":"7","key":"10.1016\/S0167-9260(83)80005-4_bib8","first-page":"67","article-title":"State-of-the-art in high speed arithmetic integrated circuits","volume":"17","author":"Waser","year":"1978","journal-title":"Comput. Design"},{"issue":"3","key":"10.1016\/S0167-9260(83)80005-4_bib9","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TC.1982.1675982","article-title":"A regular layout for parallel adders","volume":"31","author":"Brent","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(83)80005-4_bib10","series-title":"Proc. Caltech Conf. on VLSI","first-page":"259","article-title":"Hierarchical design for VLSI problems and advantages","author":"Cleemput","year":"1979"},{"year":"1979","author":"Hwang","key":"10.1016\/S0167-9260(83)80005-4_bib11"},{"year":"1980","author":"Mead","key":"10.1016\/S0167-9260(83)80005-4_bib12"},{"key":"10.1016\/S0167-9260(83)80005-4_bib13","first-page":"542","article-title":"Delay-time optimization for deriving and sensing of signals on high capacitance paths of VLSI systems","volume":"ED-26","author":"Mohsen","year":"1979","journal-title":"IEEE Trans. Electronic Devices"},{"key":"10.1016\/S0167-9260(83)80005-4_bib14","series-title":"Proc. Caltech Conference on VLSI","article-title":"Minimum propagation delay in VLSI","author":"Mead","year":"1981"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926083800054?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926083800054?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T09:11:54Z","timestamp":1759137114000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167926083800054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,12]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1983,12]]}},"alternative-id":["S0167926083800054"],"URL":"https:\/\/doi.org\/10.1016\/s0167-9260(83)80005-4","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1983,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An area-time efficient NMOS adder","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0167-9260(83)80005-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1983 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}