{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:09:34Z","timestamp":1725458974641},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540188346"},{"type":"electronic","value":"9783540481904"}],"license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/bfb0035828","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:40:10Z","timestamp":1138203610000},"page":"18-28","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["On the construction of optimal time adders"],"prefix":"10.1007","author":[{"given":"Bernd","family":"Becker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reiner","family":"Kolla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,23]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"B. Becker: \u201dEfficient Testing of Optimal-Time Adders\u201d, MFCS, Bratislava 1986, Lecture Notes in Comp.Sc. 133, 218\u2013229","DOI":"10.1007\/BFb0016245"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"B. Becker, G. Hotz, R. Kolla, P. Molitor, H.G. Osthof: \u201dHierarchical Design based on a Calculus of Nets\u201d, Proc. 24th ACM\/IEEE Design Autom. Conf., Miami, 1987, 649\u2013653","DOI":"10.1145\/37888.37992"},{"key":"3_CR3","unstructured":"B. Becker, U. Sparmann: \u201dA Uniform Test Approach for RCC-Adders\u201d, T.R., 7\/1987, SFB 124, Saarbr\u00fccken 1987"},{"key":"3_CR4","first-page":"324","volume-title":"Fast and Easily testable Implementation of Arithmetic Functions","author":"D. Bhattacharya","year":"1986","unstructured":"D. Bhattacharya, J.P. Hayes: \u201dFast and Easily testable Implementation of Arithmetic Functions\u201d, FCTS, Wien 1986, 324\u2013329"},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TC.1982.1675982","volume":"C-31","author":"R.P. Brent","year":"1982","unstructured":"R.P. Brent, H.T. Kung: \u201dA regular Layout for Parallel Adders\u201d, IEEE Trans. on Comp., C-31, 1982, 260\u2013264","journal-title":"IEEE Trans. on Comp."},{"key":"3_CR6","unstructured":"G. Hotz, B. Becker, R. Kolla, P. Molitor: \u201dEin logisch-topologischer Kalk\u00fcl zur Konstruktion von integrierten Schaltkreisen\u201d, Informatik: Forschung und Entwicklung 1986 Band 1 und 2 (Springer-Verlag)"},{"key":"3_CR7","volume-title":"VENUS \u2014 Ein Enwurf von VLSI-Schaltungen","author":"E. H\u00f6rbst","year":"1986","unstructured":"E. H\u00f6rbst, M. Nett, H. Schw\u00e4rtzel: \u201dVENUS \u2014 Ein Enwurf von VLSI-Schaltungen\u201d, Springer-Verlag Berlin Heidelberg New-York Tokyo 1986"},{"key":"3_CR8","unstructured":"G. Hotz: \u201dZur Reduktionstheorie der booleschen Algebra\u201d, Colloquium \u00fcber Schaltkreis-und Schaltwerk-Theorie, (1960), Herausgeber: Unger H., Peschel E., Birkh\u00e4user Verlag, 1961"},{"key":"3_CR9","doi-asserted-by":"crossref","DOI":"10.1515\/9783111343716","volume-title":"Schaltkreistheorie","author":"G. Hotz","year":"1974","unstructured":"G. Hotz: \u201dSchaltkreistheorie\u201d, Berlin, New York: de Gruyter, 1974"},{"key":"3_CR10","unstructured":"R. Kolla: \u201dSpezifikation und Expansion logisch-topologischer Netze\u201d, Dissertation, Universit\u00e4t des Saarlandes, 1987"},{"key":"3_CR11","unstructured":"P. Molitor: \u201d\u00dcber die Bikategorie der logisch topologischen Netze und ihre Semantik\u201d, Dissertation, Universit\u00e4t des Saarlandes, 1986"},{"key":"3_CR12","first-page":"226","volume":"9","author":"J. Sklansky","year":"1960","unstructured":"J. Sklansky: \u201dConditional sum addition logic\u201d, IRE-EC 9, 226\u2013231 (1960)","journal-title":"IRE-EC"}],"container-title":["Lecture Notes in Computer Science","STACS 88"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035828","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T20:31:24Z","timestamp":1578515484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035828"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540188346","9783540481904"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0035828","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]},"assertion":[{"value":"23 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}