{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T15:49:11Z","timestamp":1649173751928},"reference-count":4,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1986,4,1]],"date-time":"1986-04-01T00:00:00Z","timestamp":512697600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1986,4]]},"DOI":"10.1016\/0020-0190(86)90027-x","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"193-195","source":"Crossref","is-referenced-by-count":1,"title":["A note on the VLSI counter"],"prefix":"10.1016","volume":"22","author":[{"given":"B","family":"Codenotti","sequence":"first","affiliation":[]},{"given":"G","family":"Lotti","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(86)90027-X_BIB1","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1137\/0205040","article-title":"Fast parallel matrix inversion algorithms","volume":"5","author":"Csanky","year":"1976","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/0020-0190(86)90027-X_BIB2","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0020-0190(80)90010-1","article-title":"The complexity of a VLSI adder","volume":"11","author":"Johnson","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(86)90027-X_BIB3","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1145\/321879.321882","article-title":"Bounds to complexities of networks for sorting and for switching","volume":"22","author":"Muller","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(86)90027-X_BIB4","series-title":"Proc. 11th Ann. ACM Symp. on the Theory of Computing (SIGACT)","first-page":"81","article-title":"Area-time complexity for VLSI","author":"Thompson","year":"1979"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908690027X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908690027X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T05:29:17Z","timestamp":1553578157000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001908690027X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,4]]},"references-count":4,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1986,4]]}},"alternative-id":["002001908690027X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90027-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1986,4]]}}}