{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:24Z","timestamp":1725574104999},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642183805"},{"type":"electronic","value":"9783642183812"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18381-2_38","type":"book-chapter","created":{"date-parts":[[2011,1,4]],"date-time":"2011-01-04T11:01:51Z","timestamp":1294138911000},"page":"455-466","source":"Crossref","is-referenced-by-count":0,"title":["Finding the Description of Structure by Counting Method: A Case Study"],"prefix":"10.1007","author":[{"given":"Ahti","family":"Peder","sequence":"first","affiliation":[]},{"given":"Mati","family":"Tombak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R. Bryant","year":"1986","unstructured":"Bryant, R.: Graph-based Algorithms for Boolean Function Manipulation. IEEE Transaction on Computers C\u00a035, 677\u2013691 (1986)","journal-title":"IEEE Transaction on Computers C"},{"key":"38_CR2","unstructured":"Jutman, A., Peder, A., Raik, J., Tombak, M., Ubar, R.: Structurally Synthesized Binary Decision Diagrams. In: 6th International Workshop on Boolean Problems, Freiberg University, pp. 271\u2013278 (2004)"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1002\/j.1538-7305.1959.tb01585.x","volume":"38","author":"C. Lee","year":"1959","unstructured":"Lee, C.: Representation of Switching Circuits by Binary Decision Diagrams. Bell. Syst. Tech. Journal\u00a038, 985\u2013999 (1959)","journal-title":"Bell. Syst. Tech. Journal"},{"key":"38_CR4","unstructured":"Peder, A: Superpositional Graphs and Finding the Description of Structure by Counting Method. Phd thesis, Tartu (2010), http:\/\/hdl.handle.net\/10062\/14853"},{"key":"38_CR5","unstructured":"Peder, A., Isotamm, A., Tombak, M.: A Meta-Compiler for Propositional Formulae. In: Seventh Symposium on Programming Languages and Software Tools, Szeged, Hungary, pp. 250\u2013261 (2001)"},{"key":"38_CR6","doi-asserted-by":"crossref","first-page":"51","DOI":"10.12697\/ACUTM.2009.13.06","volume":"13","author":"A. Peder","year":"2009","unstructured":"Peder, A., Tombak, M.: Superpositional Graphs. Acta et Commentationes Universitatis Tartuensis de Mathematica\u00a013, 51\u201364 (2009), http:\/\/www.ut.ee\/~ahtip\/LOG_COMP\/PederTombakACTA2009.pdf","journal-title":"Acta et Commentationes Universitatis Tartuensis de Mathematica"},{"key":"38_CR7","unstructured":"Sloane, N.: On-Line Encyclopedia of Integer Sequences, http:\/\/www.research.att.com\/~njas\/sequences\/"},{"key":"38_CR8","unstructured":"Stamm-Wilbrandt, H.: Programming in Propositional Logic or Reductions: Back to the Roots (Satisfiability). Technical reports of Department of Computer Science III, University of Bonn, pp 24 (1993)"},{"issue":"4","key":"38_CR9","doi-asserted-by":"publisher","first-page":"344","DOI":"10.2307\/2974582","volume":"104","author":"R.P. Stanley","year":"1997","unstructured":"Stanley, R.P.: Hipparchus, Plutarch, Schr\u00f6der and Hough. Am. Math. Monthly\u00a0104(4), 344 (1997)","journal-title":"Am. Math. Monthly"},{"key":"38_CR10","unstructured":"Ubar, R.: Test Generation for Digital Circuits Using Alternative Graphs (in Russian). In: Proc. Tallinn Technical University, 409, Tallinn TU, Estonia, pp. 75\u201381 (1976)"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Ubar, R., Devadze, S., Raik, J., Jutman, A.: Parallel X-fault Simulation with Critical Path Tracing Technique. In: Proc. of the IEEE\/ACM DATE Conference, Dresden, Germany, p. 6 (2010)","DOI":"10.1109\/DATE.2010.5456929"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2011: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18381-2_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T14:47:08Z","timestamp":1685890028000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18381-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642183805","9783642183812"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18381-2_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}