{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:49:04Z","timestamp":1725468544825},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648277"},{"type":"electronic","value":"9783540685326"}],"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\/bfb0055814","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T17:36:31Z","timestamp":1155836191000},"page":"636-644","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Blockwise variable orderings for shared BDDs"],"prefix":"10.1007","author":[{"given":"Harry","family":"Preu\u00df","sequence":"first","affiliation":[]},{"given":"Anand","family":"Srivastav","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"61_CR1","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1109\/12.537122","volume":"45","author":"B. Bollig","year":"1996","unstructured":"B. Bollig, I. Wegener: Improving the variable ordering of OBDDs is NP-complete. IEEE Transactions on Computers 45, pages 993\u20131002, 1996","journal-title":"IEEE Transactions on Computers"},{"issue":"8","key":"61_CR2","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 Transactions on Computers, vol. C-35(8), pages 677\u2013691, 1986.","journal-title":"IEEE Transactions on Computers"},{"key":"61_CR3","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R. E. Bryant","year":"1992","unstructured":"R. E. Bryant: Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys, vol. 24, pages 293\u2013318, 1992.","journal-title":"ACM Computing Surveys"},{"key":"61_CR4","doi-asserted-by":"publisher","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, pages 710\u2013713, 1990.","journal-title":"IEEE Trans. on Computers"},{"key":"61_CR5","doi-asserted-by":"crossref","unstructured":"S. Minato, N. Ishiura, S. Yajima: Shared binary decision diagrams with attributed edges for efficient Boolean function manipulation. Design Automation Conference, pages 52\u201357, 1990.","DOI":"10.1145\/123186.123225"},{"key":"61_CR6","unstructured":"M. Sauerhoff, I. Wegener, R. Werchner: Optimal ordered binary decision diagrams for fanout-free circuits. Proc. of SASIMI 1996."},{"key":"61_CR7","unstructured":"M. Sauerhoff, I. Wegener, R. Werchner: Optimal ordered binary decision diagrams for tree-like circuits. Forschungsbericht Nr. 613, Universit\u00e4t Dortmund 1996."},{"key":"61_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1142\/S0129626493000022","volume":"3","author":"D. Sieling","year":"1993","unstructured":"D. Sieling, I. Wegener: NC-algorithms for operations on binary decision diagrams. Parallel Processing Letters, vol. 3, pages 3\u201312, 1993","journal-title":"Parallel Processing Letters"},{"key":"61_CR9","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/3-540-57568-5_270","volume":"762","author":"S. Tani","year":"1993","unstructured":"S. Tani, K. Hamaguchi, S. Yajima: The complexity of the optimal variable ordering problems of a shared binary decision diagram. Proc. 4th Int. Symp. on Algorithms and Computation ISAAC, Lecture Notes in Computer Science 762, pages 389\u2013398, 1993.","journal-title":"Lecture Notes in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1998"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055814","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T19:46:04Z","timestamp":1578512764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055814"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0055814","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"28 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}