{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:02:15Z","timestamp":1725483735563},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679011"},{"type":"electronic","value":"9783540446125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44612-5_43","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T09:28:20Z","timestamp":1178357300000},"page":"477-487","source":"Crossref","is-referenced-by-count":1,"title":["Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and Their Generalization"],"prefix":"10.1007","author":[{"given":"Danie","family":"Kr\u00e1l\u2019","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"43_CR1","first-page":"487","volume":"194","author":"L. Arlazarov","year":"1970","unstructured":"Arlazarov, L., Dinic, E. A., Kronrod, A., Faradzev, I. A.: On economical construction of the transitive closure of a directed graph. Dokl. Akad. Nauk USSR 1970, 194, pp. 487\u2013488 (in Russian), Soviet. Math. Dokl. 11, pp. 1209-1210 (in English)","journal-title":"Dokl. Akad. Nauk USSR"},{"key":"43_CR2","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R. E. Bryant","year":"1986","unstructured":"Bryant, R. E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Computers 1986, 35, pp. 677\u2013691","journal-title":"IEEE Trans. on Computers"},{"key":"43_CR3","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R. E. Bryant","year":"1992","unstructured":"Bryant, R. E.: Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Comp. Surveys 1992, 24, pp. 293\u2013318","journal-title":"ACM Comp. Surveys"},{"key":"43_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symbolic Computation 1990, 9, pp. 251\u2013280","journal-title":"J. Symbolic Computation"},{"key":"43_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF00709139","volume":"8","author":"J. Gergov","year":"1996","unstructured":"Gergov, J., Meinel, Ch.: Mod-2-OBDDs \u2014 a data structure that generalizes EXOR-Sum-of-Products and Ordered Binary Decision Diagrams. Formal Methods in System Design 1996, 8, pp. 273\u2013282","journal-title":"Formal Methods in System Design"},{"key":"43_CR6","unstructured":"Kr\u00e1l\u2019, D.: Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and their Generalization. ECCC report TR00-013"},{"key":"43_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0020-0190(98)00113-6","volume":"67","author":"M. L\u00f6bbing","year":"1998","unstructured":"L\u00f6bbing, M., Sieling, D., Wegener, I.: Parity OBDDs cannot be handled efficiently enough. Information Processing Letters 1998, 67, pp. 163\u2013168","journal-title":"Information Processing Letters"},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"Waack, St.: On the descriptive and algorithmic power of parity ordered binary decision diagrams. Proc. 14th STACS 1997, Lecture Notes in Computer Sci. 1200, Springer Verlag 1997, pp. 201\u2013212","DOI":"10.1007\/BFb0023460"},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Branching Programs and Binary Decision Diagrams \u2014 Theory and Applications. To appear (2000) in the SIAM monograph series Trends in Discrete Mathematics and Applications ed. P. L. Hammer.","DOI":"10.1137\/1.9780898719789"},{"key":"43_CR10","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0012-365X(95)90790-R","volume":"136","author":"I. Wegener","year":"1994","unstructured":"Wegener, I.: Efficient data structures for Boolean functions. Discrete Mathematics 1994, 136, pp. 347\u2013372","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44612-5_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T14:41:20Z","timestamp":1556376080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44612-5_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679011","9783540446125"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44612-5_43","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}