{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:35:31Z","timestamp":1761597331276},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540600459"},{"type":"electronic","value":"9783540494133"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60045-0_36","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:36:37Z","timestamp":1330259797000},"page":"4-15","source":"Crossref","is-referenced-by-count":7,"title":["Global rebuilding of OBDDs avoiding memory requirement maxima"],"prefix":"10.1007","author":[{"given":"Jochen","family":"Bern","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"Meinel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Slobodov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/S0020-0190(80)90078-2","volume":"10","author":"M. Blum","year":"1980","unstructured":"M. Blum, A. K. Chandra, M. N. Wegman: Equivalence of Free Boolean Graphs Can Be Decided Probabilistically in Polynomial Time, Inf. Process. Lett. 10, 2 (Mar.), 80\u201382, 1980.","journal-title":"Inf. Process. Lett."},{"key":"2_CR2","unstructured":"J. Bern, Ch. Meinel, A. Slobodov\u00e1: Trust \u2014 a Programming Environment for the FBDD-package, in print, Univ. Trier, 1994."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"K. S. Brace, R. L. Rudell, R. E. Bryant: Efficient Implementation of a BDD Package, Proc. of 27th ACM\/IEEE Design Automation Conference (Orlando, June), 40\u201345, 1990.","DOI":"10.1145\/123186.123222"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"K. M. Butler, D. E. ross, R. Kapur, M. R. Mercer: Heuristics to Compute Variable Orderings for Efficient Manipulation of Ordered Binary Decision Diagrams. Proc. 28th ACM\/IEEE DAC, 417\u2013420, 1991.","DOI":"10.1145\/127601.127705"},{"issue":"6","key":"2_CR5","doi-asserted-by":"crossref","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 Trans. Comput. C-35, 6 (Aug.), 677\u2013691, 1986.","journal-title":"IEEE Trans. Comput."},{"key":"2_CR6","unstructured":"B. Bollig, I. Wegener: Improving the Variable Ordering of OBDDs is NP-Complete, Forschungsbericht Nr. 542, 1994."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"M. Fujita, H. Fujisawa, N. Kawato: Evaluation and Improvements of Boolean Comparison Method Based on Binary Decision Diagrams. Proc. of IEEE ICCAD, 2\u20135, 1988.","DOI":"10.1109\/ICCAD.1988.122450"},{"key":"2_CR8","unstructured":"M. Fujita, Y. Matsunaga, T. Kakuda: On Variable Ordering of Binary Decision Diagrams for the Application of Multi-Valued Logic Synthesis. Proc. of EDAC, 502\u201353, 1991."},{"key":"2_CR9","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1109\/12.53586","volume":"39","author":"S. J. Friedman","year":"1990","unstructured":"S. J. Friedman, K. J. Supowit: Finding the Optimal Variable Ordering for binary Decision Diagrams. IEEE Trans. on Computers 39, 710\u2013713, 1990.","journal-title":"IEEE Trans. on Computers"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"S. Minato, N. Ishiura, S. Yajima: Shared Binary Decision Diagrams with Attributed edges for Efficient Boolean Function Manipulation. Proc. of the 27th ACM\/IEEE Design Automation Conference, 52\u201357, 1990.","DOI":"10.1145\/123186.123225"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"M. R. Mercer, R. Kapur, D. E. Ross: Functional Approaches to Generating Orderings for Efficient Symbolic Representation. Proc. of 29th ACM\/IEEE DAC, 614\u2013619, 1992.","DOI":"10.1109\/DAC.1992.227810"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"S. Malik, A. Wang, R. K. Brayton, A. Sangiovanni-Vincentelli: Logic Verification Using Binary Decision Diagrams in a Logic Synthesis Environment, Proc. of the IEEE International Conference on Computer-Aided Design (Santa Clara, Calif., Nov.), 6\u20139, 1988.","DOI":"10.1109\/ICCAD.1988.122451"},{"key":"2_CR13","first-page":"515","volume":"841","author":"C. Meinel","year":"1994","unstructured":"Ch. Meinel, A. Slobodov\u00e1: On the Complexity of Constructing optimal Ordered Binary Decision Diagrams, Proc. of MFCS'94, LNCS 841, 515\u2013524, 1994.","journal-title":"LNCS"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"R. Rudell: Dynamic Variable Ordering for Ordered Binary Decision Diagrams. Proc. of IEEE ICCAD, 42\u201347, 1993.","DOI":"10.1109\/ICCAD.1993.580029"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"P. Savick\u00fd, I. Wegener: Efficient Algorithms for the Transformation Between Different Types of Binary Decision Diagrams. Proc. FST&TCS, 1994.","DOI":"10.1007\/3-540-58715-2_140"},{"key":"2_CR16","first-page":"389","volume":"762","author":"S. Tani","year":"1993","unstructured":"S. Tani, K. Hamaguchi, S. Yajima: The Complexity of the Optimal Variable Ordering of a Shared Binary Decision Diagram. Proc. 4th ISAAC, LNCS 762, 389\u2013398, 1993.","journal-title":"LNCS"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"S. Tani, H. Imai: A Reordering for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs. Proc. of 5th ISAAC, LNCS, 1994.","DOI":"10.1007\/3-540-58325-4_225"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60045-0_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:28:47Z","timestamp":1605630527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60045-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540600459","9783540494133"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-60045-0_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}