{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T12:03:28Z","timestamp":1759147408287,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540652601"},{"type":"electronic","value":"9783540494775"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":[[1998]]},"DOI":"10.1007\/3-540-49477-4_34","type":"book-chapter","created":{"date-parts":[[2007,7,29]],"date-time":"2007-07-29T12:20:24Z","timestamp":1185711624000},"page":"419-428","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Sample Method for Minimization of OBDDs"],"prefix":"10.1007","author":[{"given":"Anna","family":"Slobodova","sequence":"first","affiliation":[]},{"given":"Christoph","family":"Meinel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,24]]},"reference":[{"key":"34_CR1","first-page":"5-1","volume":"5b","author":"B. Bollig","year":"1995","unstructured":"B. Bollig, M. Lobbig, and I. Wegener. Simulated Annealing to Improve Variable Orderings for OBDDs. Proc. IWLS, 5b:5-1\u20135-10, 1995.","journal-title":"Proc. IWLS"},{"key":"34_CR2","series-title":"Lect Notes Comput Sci","first-page":"299","volume-title":"Proc. CAV","author":"J. Bern","year":"1995","unstructured":"J. Bern, Ch. Meinel, and A. Slobodova. Global Rebuilding of OBDDs-Avoiding Memory Requirement Maxima. Proc. CAV, (LNCS 939:299\u2013308, 1995."},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R.E. Bryant","year":"1986","unstructured":"R.E. Bryant. Graph Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, (C-35):677\u2013691, 1986.","journal-title":"IEEE Transactions on Computers"},{"issue":"9","key":"34_CR4","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1109\/12.537122","volume":"45","author":"B. Bollig","year":"1996","unstructured":"B. Bollig and I. Wegener. Improving the Variable Ordering of OBDDs is NP-complete. IEEE Transactions on Computers, (45(9)):993\u20131002, 1996.","journal-title":"IEEE Transactions on Computers"},{"issue":"6","key":"34_CR5","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1049\/ip-cdt:19960789","volume":"143","author":"R. Drechsler","year":"1996","unstructured":"R. Drechsler, B. Becker, and N. Gockel. A Genetic Algorithm for Variable Ordering of OBDDs. IEEE Proc. Computers and Digital Techniques, 143(6):364\u2013368, 1996.","journal-title":"IEEE Proc. Computers and Digital Techniques"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"R. Drechsler, N. Drechsler, and W. G\u00fcnther. Fast Exact Minimization of BDDs. IEEE\/ACM Proc. Design Automation Conference, 1998.","DOI":"10.1145\/277044.277099"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"S.J. Friedman, and K.J. Supowit. Finding the Optimal Variable Ordering for Binary Decision Diagrams IEEE\/ACM Proc. DAC, 348\u2013356, 1987.","DOI":"10.1145\/37888.37941"},{"issue":"5","key":"34_CR8","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1109\/12.53586","volume":"39","author":"S.J. Friedman","year":"1990","unstructured":"S.J. Friedman, and K.J. Supowit. Finding the Optimal Variable Ordering for Binary Decision Diagrams IEEE Transactions on Computers, 39(5):710\u2013713, 1990.","journal-title":"IEEE Transactions on Computers"},{"key":"34_CR9","unstructured":"N. Ishiura, H. Sawada, and S. Yajima. Minimization of Binary Decision Diagrams Based on Exchanges of Variables IEEE Proc. of ICC AD, 472\u2013475, 1991."},{"key":"34_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":":515","DOI":"10.1007\/3-540-58338-6_98","volume-title":"Proc. MFCS","author":"Ch. Meinel","year":"1994","unstructured":"Ch. Meinel and A. Slobodova. On the Complexity of Constructing Optimal Ordered Binary Decision Diagrams. Proc. MFCS, (LNCS 841):515\u2013525, 1994."},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Ch. Meinel and A. Slobodova. Speeding up Variable Reordering of OBDDs. IEEE Proc. of ICCD, 338\u2013343, 1997.","DOI":"10.1109\/ICCD.1997.628892"},{"key":"34_CR12","unstructured":"S. Panda and F. Somenzi. Who are the Variables in Your Neighbourhood. Proc. ACM\/IEEE ICCAD, 74\u201377, 1995."},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"S. Panda, F. Somenzi, and B.F. Plessier. Symmetry Detection and Dynamic Variable Ordering of Decision Diagrams. Proc. ICCAD, 628\u2013631, 1994.","DOI":"10.1109\/ICCAD.1994.629887"},{"key":"34_CR14","unstructured":"R. Rudell. Dynamic Variable Ordering for Ordered Binary Decision Diagrams. Proc. ACM\/IEEE ICCAD, 42\u201347, 1993."},{"key":"34_CR15","unstructured":"F. Somenzi. CUDD: CU Decision Diagram Package. Release 2.1.2. University of Colorado, Boulder) ( ftp:\/\/vlsi.colorado.edu\/pub\/ ), 1997."},{"issue":"3","key":"34_CR16","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0020-0190(93)90256-9","volume":"48","author":"D. Sieling","year":"1993","unstructured":"D. Sieling, and I. Wegener. Reduction of BDDs in Linear Time, Information Processing Letters, 48(3):139\u2013144, 1993.","journal-title":"Information Processing Letters"},{"key":"34_CR17","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s002360050083","volume":"34","author":"P. Savick\u00fd","year":"1997","unstructured":"P. Savick\u00fd, and I. Wegener. Efficient Algorithms for the Transformation Between Different Types of Binary Decision Diagrams Acta Informatica, 34:245\u2013256, 1997.","journal-title":"Acta Informatica"},{"key":"34_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/3-540-57568-5_270","volume-title":"Proc. ISAAC","author":"S. Tani","year":"1993","unstructured":"S. Tani, K. Hamaguchi, and S. Yajima. The Complexity of the Optimal Variable Ordering Problem of Shared Binary Decision Diagrams. Proc. ISAAC, (LNCS762):389\u2013398, 1993."}],"container-title":["Lecture Notes in Computer Science","SOFSEM\u2019 98: Theory and Practice of Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49477-4_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T00:21:42Z","timestamp":1737332502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49477-4_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540652601","9783540494775"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-49477-4_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"24 September 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}