{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T20:07:03Z","timestamp":1649189223656},"reference-count":5,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1987,7,1]],"date-time":"1987-07-01T00:00:00Z","timestamp":552096000000},"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":[[1987,7]]},"DOI":"10.1016\/0020-0190(87)90218-3","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"397-400","source":"Crossref","is-referenced-by-count":2,"title":["The area-time complexity of the VLSI counter"],"prefix":"10.1016","volume":"25","author":[{"given":"Imrich","family":"V\u0159to","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0020-0190(87)90218-3_BIB1","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01840437","article-title":"Area-time lower bound technique with application to sorting","volume":"1","author":"Bilardi","year":"1986","journal-title":"Algorithmica"},{"issue":"4","key":"10.1016\/0020-0190(87)90218-3_BIB2","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0020-0190(86)90027-X","article-title":"A note on the VLSI counter","volume":"22","author":"Codenotti","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(87)90218-3_BIB3","series-title":"Proc. 23rd Conf. on Foundations of Computer Science","first-page":"85","article-title":"A layout strategy for VLSI which is provably good","author":"Leighton","year":"1982"},{"key":"10.1016\/0020-0190(87)90218-3_BIB4","series-title":"Proc. Asilomar Conf. on Circuits Systems, and Computers","article-title":"On the area-time optimal design of l-selectors","author":"Thompson","year":"1985"},{"key":"10.1016\/0020-0190(87)90218-3_BIB5","series-title":"Proc. 13th Ann. ACM Symp. on Theory of Computation","first-page":"308","article-title":"The entropic limitation of VLSI computations","author":"Yao","year":"1981"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087902183?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087902183?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:54:59Z","timestamp":1553594099000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019087902183"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,7]]},"references-count":5,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1987,7]]}},"alternative-id":["0020019087902183"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(87)90218-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1987,7]]}}}