{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:14:10Z","timestamp":1725664450062},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540587156"},{"type":"electronic","value":"9783540490548"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58715-2_140","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:41:53Z","timestamp":1330274513000},"page":"390-401","source":"Crossref","is-referenced-by-count":1,"title":["Efficient algorithms for the transformation between different types of binary decision diagrams"],"prefix":"10.1007","author":[{"given":"Petr","family":"Savick\u00fd","sequence":"first","affiliation":[]},{"given":"Ingo","family":"Wegener","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/S0020-0190(80)90078-2","volume":"10","author":"M. Blum","year":"1980","unstructured":"Blum, M., Chandra, A. K. and Wegman, M. W. (1980). Equivalence of free Boolean graphs can be decided probabilistically in polynomial time. Information Processing Letters 10, 80\u201382.","journal-title":"Information Processing Letters"},{"unstructured":"Bollig, B., L\u00f6bbing, M. and Wegener, I. (1994). Variable orderings for OBDDs, simulated annealing, and the hidden weighted bit function. Submitted to Formal Methods in System Design.","key":"32_CR2"},{"key":"32_CR3","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E. (1986). Graph-based algorithms for Boolean function manipulations. IEEE Trans. on Computer C-35, 677\u2013691.","journal-title":"IEEE Trans. on Computer"},{"key":"32_CR4","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R.E. Bryant","year":"1992","unstructured":"Bryant, R.E. (1992). Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys 24, 293\u2013318.","journal-title":"ACM Computing Surveys"},{"key":"32_CR5","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/3-540-08860-1_17","volume":"62","author":"S. Fortune","year":"1978","unstructured":"Fortune, S., Hopcroft, J. and Schmidt, E. M. (1978) The complexity of equivalence and containment for free single variable program schemes. Proc. ICALP. Lecture Notes in Computer Science 62, 227\u2013240.","journal-title":"Proc. ICALP. Lecture Notes in Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Fujita, M., Matsunaga, Y. and Kakuda, T. (1991). On variable ordering of binary decision diagrams for the application of multi-level logic synthesis. Proc. of European Design Automation Conference EDAC, 50\u201354.","key":"32_CR6","DOI":"10.1109\/EDAC.1991.206358"},{"unstructured":"Gergov, J. and Meinel, Ch. (1992). Efficient analysis and manipulation of OBDDs can be extended to FBDDs. To appear in IEEE Trans. on Computers.","key":"32_CR7"},{"doi-asserted-by":"crossref","unstructured":"Ishiura, N., Sawada, H. and Yajima, S. (1991). Minimization of binary decision diagrams based on exchanges of variables. Proc. of IEEE Int. Conf. on Computer Aided Design ICCAD, 472\u2013475.","key":"32_CR8","DOI":"10.1109\/ICCAD.1991.185307"},{"unstructured":"Meinel, Ch. and Slobodov\u00e1, A. (1994). On the complexity of constructing optimal OBDDs. To appear in MFCS'94.","key":"32_CR9"},{"doi-asserted-by":"crossref","unstructured":"Mercer, M.R., Kapur, R. and Ross, D.E. (1992). Functional approaches to generating orderings for efficient symbolic representation. Proc. of 29. ACM\/IEEE Design Automation Conference, 614\u2013619.","key":"32_CR10","DOI":"10.1109\/DAC.1992.227810"},{"doi-asserted-by":"crossref","unstructured":"Rudell, R. (1993). Dynamic variable ordering for ordered binary decision diagrams. Proc. of IEEE Int. Conf. on Computer Aided Design ICCAD, 42\u201347.","key":"32_CR11","DOI":"10.1109\/ICCAD.1993.580029"},{"key":"32_CR12","first-page":"1995","volume":"143","author":"D. Sieling","year":"1992","unstructured":"Sieling, D. and Wegener, I. (1992). Graph driven BDDs \u2014 a new data structure for Boolean functions. To appear in Theoretical Computer Science 143, 1995.","journal-title":"To appear in Theoretical Computer Science"},{"key":"32_CR13","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0020-0190(93)90256-9","volume":"48","author":"D. Sieling","year":"1993","unstructured":"Sieling, D. and Wegener, I. (1993). Reduction of OBDDs in linear time. Information Processing Letters 48, 139\u2013144.","journal-title":"Information Processing Letters"},{"unstructured":"Wegener, I. (1993). Efficient data structures for Boolean functions. To appear in a special volume \u201cTrends in Discrete Mathematics\u201d of Discrete Mathematics.","key":"32_CR14"}],"container-title":["Lecture Notes in Computer Science","Foundation of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58715-2_140.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:20:03Z","timestamp":1619572803000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58715-2_140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540587156","9783540490548"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-58715-2_140","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}