{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:50Z","timestamp":1725663290336},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540187714"},{"type":"electronic","value":"9783540481782"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18771-5_57","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:47:47Z","timestamp":1330199267000},"page":"250-261","source":"Crossref","is-referenced-by-count":3,"title":["On network algebras and recursive equations"],"prefix":"10.1007","author":[{"given":"G\u00fcnter","family":"Hotz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reiner","family":"Kolla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Molitor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"B.Becker: \u201cAn easily testable optimal-time VLSI-multiplier\u201d Proceedings of EUROMICRO 85, pp.401\u2013411, Brussels, North-Holland.","DOI":"10.1007\/BF00292108"},{"key":"18_CR2","unstructured":"H.B\u00fchler: \u201cKorrektheitsbeweise von rekursiv beschriebenen logisch-topologischen Netzen\u201d Diplomarbeit, Saarbr\u00fccken 1986."},{"key":"18_CR3","unstructured":"G.Hotz, B.Becker, R.Kolla, P.Molitor: \u201cEin logischer-topologischer Kalk\u00fcl zur Konstruktion von integrierten Schaltkreisen\u201d INFORMATIK: Forschung und Entwicklung, 1986, Heft 1 und 2, Springer Verlag 1986."},{"key":"18_CR4","unstructured":"B.Becker, G.Hotz, R.Kolla, P.Molitor, H.G.Osthof: \u201cCADIC: A System for Hierarchical Design of Integrated Circuits\u201d TR07\/1986, SFB124, Saarbr\u00fccken 1986."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"B.Becker, G.Hotz, R.Kolla, P.Molitor, H.G.Osthof: \u201cHierarchical Design based on a Calculus of Nets\u201d will appear in the Proceedings of the 24th Design Automation Conference, Miami 1987.","DOI":"10.1145\/37888.37992"},{"key":"18_CR6","volume-title":"\u201cESCHER \u2014 A geometrical Layout System for Recursively Defined Circuits\u201d CMU-CS-85-150","author":"E. Clarke","year":"1985","unstructured":"E. Clarke, Y. Feng: \u201cESCHER \u2014 A geometrical Layout System for Recursively Defined Circuits\u201d CMU-CS-85-150, Carnegie-Mellon University, Pitsburgh 1985."},{"key":"18_CR7","unstructured":"V.Claus: \u201cEbene Realisierungen von Schaltkreisen\u201d Dissertation, Saarbr\u00fccken 1970."},{"key":"18_CR8","unstructured":"G.Hotz: \u201cEine Algebraisierung des Syntheseproblems f\u00fcr Schaltkreise\u201d EIK 1, 1965, pp.185\u2013205, 209\u2013231."},{"key":"18_CR9","unstructured":"R.Kolla, P.Molitor: \u201cA note on hierarchical layer-assignment\u201d TR08\/1986, SFB124, Saarbr\u00fccken 1986."},{"key":"18_CR10","unstructured":"R.Kolla: \u201c\u00dcber Fragen im Zusammenhang mit der Spezifikation und Expansion gro\u00dfer logisch topologischer Netze\u201d Dissertation, Saarbr\u00fccken 1987."},{"key":"18_CR11","unstructured":"R.Kolla: \u201cProving correctness of logic topological nets\u201d will appear as technical report, SFB124, Saarbr\u00fccken 1987."},{"key":"18_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-93084-2","volume-title":"Linguistische Datenverarbeitung mit COMSKEE","author":"J. Messerschmidt","year":"1984","unstructured":"J. Messerschmidt: \u201cLinguistische Datenverarbeitung mit COMSKEE\u201d Stuttgart: B.G. Teubner 1984"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0165-6074(85)90027-4","volume":"16","author":"P. Molitor","year":"1985","unstructured":"P. Molitor: \u201cLayer Assignment by Simulated Annealing\u201d Microprocessing and Microprogramming 16 (1985), pp.345\u2013350, North-Holland.","journal-title":"Microprocessing and Microprogramming"},{"key":"18_CR14","unstructured":"P.Molitor: \u201c\u00dcber die Bikategorie der logisch topologischen Netze und ihre Semantik\u201d Dissertation, Saarbr\u00fccken 1986."},{"key":"18_CR15","unstructured":"P.Molitor: \u201cFree Net Algebras in VLSI-Theory\u201d in preparation, Saarbr\u00fccken 1987."},{"key":"18_CR16","first-page":"226","volume":"9","author":"J. Sklansky","year":"1960","unstructured":"J. Sklansky: \u201cConditional-sum addition logic\u201d IRE-EC 9, pp.226\u2013231, 1960.","journal-title":"IRE-EC"}],"container-title":["Lecture Notes in Computer Science","Graph-Grammars and Their Application to Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18771-5_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:15:34Z","timestamp":1605644134000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18771-5_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540187714","9783540481782"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-18771-5_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}