{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T20:53:32Z","timestamp":1674852812974},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,7,1]],"date-time":"1991-07-01T00:00:00Z","timestamp":678326400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8052,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991,7]]},"DOI":"10.1016\/0304-3975(91)90161-t","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"225-250","source":"Crossref","is-referenced-by-count":2,"title":["Computations over finite monoids and their test complexity"],"prefix":"10.1016","volume":"84","author":[{"given":"Bernd","family":"Becker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uwe","family":"Sparmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90161-T_BIB1","article-title":"Design of testable structures defined by simple loops","volume":"30","author":"Abraham","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(91)90161-T_BIB2","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF00292108","article-title":"An easily testable optimal time VLSI-multiplier","volume":"24","author":"Becker","year":"1987","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(91)90161-T_BIB3","doi-asserted-by":"crossref","DOI":"10.1109\/12.2262","article-title":"Efficient testing of optimal-time adders","volume":"37","author":"Becker","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(91)90161-T_BIB4","article-title":"Fast and easily testable implementation of arithmetic functions","author":"Bhattacharya","year":"1986","journal-title":"Proc. 16th Internat. Symp. on Fault Tolerant Computing Systems"},{"key":"10.1016\/0304-3975(91)90161-T_BIB5","article-title":"A regular layout for parallel adders","volume":"31","author":"Brent","year":"1982","journal-title":"IEEE Trans. Comp."},{"key":"10.1016\/0304-3975(91)90161-T_BIB6","article-title":"Digital filtering in VLSI","author":"Bilardi","year":"1986","journal-title":"Proc. 2nd Aegean Workshop on Computing"},{"key":"10.1016\/0304-3975(91)90161-T_BIB7","article-title":"Size-time complexity of boolean networks for prefix computations","author":"Bilardi","year":"1987","journal-title":"Proc. 19th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(91)90161-T_BIB8","article-title":"A uniform test approach for RCC-Adders","author":"Becker","year":"1988","journal-title":"Proc. 3rd Aegean Workshop of Computing"},{"key":"10.1016\/0304-3975(91)90161-T_BIB9","article-title":"Testing in two-dimensional iterative logic arrays","author":"Cheng","year":"1986","journal-title":"Proc. 16th Internat. Symp. on Fault Tolerant Computing Systems"},{"key":"10.1016\/0304-3975(91)90161-T_BIB10","first-page":"165","article-title":"A logic design structure for LSI testability","volume":"2","author":"Eichelberger","year":"1978","journal-title":"J. Design Automation Fault-Tolerant Comput."},{"key":"10.1016\/0304-3975(91)90161-T_BIB11","first-page":"2","article-title":"The design of two easily-testable VLSI array multipliers","author":"Ferguson","year":"1983","journal-title":"Proc. 6th Symp. on Computer Arithmetic"},{"key":"10.1016\/0304-3975(91)90161-T_BIB12","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1109\/T-C.1973.223651","article-title":"Easily testable iterative systems","volume":"22","author":"Friedman","year":"1973","journal-title":"IEEE Trans. Comput."},{"issue":"11","key":"10.1016\/0304-3975(91)90161-T_BIB13","doi-asserted-by":"crossref","DOI":"10.1109\/TC.1981.1675712","article-title":"A design of programmable logic arrays with universal tests","volume":"30","author":"Fujiwara","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(91)90161-T_BIB14","article-title":"The complexity of fault detection problems for combinational logic circuits","volume":"31","author":"Fujiwara","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(91)90161-T_BIB15","article-title":"Ein C-Test f\u00fcr einen schnellen Multiplizierer","author":"Hartmann","year":"1988","journal-title":"Technical Report 02\/1988"},{"key":"10.1016\/0304-3975(91)90161-T_BIB16","article-title":"On realizations of boolean functions requiring a minimal or near-minimal number of tests","volume":"20","author":"Hayes","year":"1971","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(91)90161-T_BIB17","article-title":"Built-in logic block observation technique","author":"Konemann","year":"1979","journal-title":"Proc. IEEE Test Conf."},{"key":"10.1016\/0304-3975(91)90161-T_BIB18","series-title":"The Structure of Computers and Computations","author":"Kuck","year":"1978"},{"issue":"4","key":"10.1016\/0304-3975(91)90161-T_BIB19","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Ladner","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(91)90161-T_BIB20","article-title":"Built-in tests for arbitrarily structured VLSI carry-lookahead adders","author":"Montoye","year":"1983","journal-title":"Proc. IFIP Internat. Conf. on Very Large Scale Integration (VLSI '83)"},{"issue":"2","key":"10.1016\/0304-3975(91)90161-T_BIB21","doi-asserted-by":"crossref","DOI":"10.1016\/0196-6774(86)90003-9","article-title":"Depth-size trade-offs for parallel prefix computation","volume":"7","author":"Snir","year":"1986","journal-title":"J. Algorithms"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190161T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190161T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T06:25:45Z","timestamp":1580883945000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190161T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["030439759190161T"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90161-t","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,7]]}}}