{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:00:02Z","timestamp":1725490802193},"publisher-location":"Boston, MA","reference-count":24,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387736600"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-73661-7_19","type":"book-chapter","created":{"date-parts":[[2007,9,10]],"date-time":"2007-09-10T20:22:03Z","timestamp":1189455723000},"page":"299-315","source":"Crossref","is-referenced-by-count":1,"title":["Exact BDD Minimization for Path-Related Objective Functions"],"prefix":"10.1007","author":[{"given":"R\u00fcdiger","family":"Ebendt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Drechsler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1_19","volume-title":"Dynamic Programming","author":"R Bellman","year":"1957","unstructured":"R. Bellman. Dynamic Programming. Princeton University Press, Princeton, New Jersey, 1957."},{"key":"19_CR2_19","doi-asserted-by":"crossref","unstructured":"R. Bellmann. Combinatorial processes and dynamic programming. In Proc. of Symp. in Applied Mathematics of the American Mathematical Society, 1960.","DOI":"10.1090\/psapm\/010\/0113718"},{"key":"19_CR3_19","doi-asserted-by":"crossref","unstructured":"R. Bellmann. Dynamic programming treatment of the traveling salesman problem. J. Assoc. Comput. Mach., (9):61-63, 1962.","DOI":"10.1145\/321105.321111"},{"issue":"9","key":"19_CR4_19","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 in NP-complete. IEEE Trans. on Comp., 45(9):993-1002, 1996.","journal-title":"IEEE Trans. on Comp."},{"key":"19_CR5_19","doi-asserted-by":"crossref","unstructured":"K. Brace, R. Rudell, and R. Bryant. Efficient implementation of a BDD package. In Design Automation Conf., pages 40-45, 1990.","DOI":"10.1145\/123186.123222"},{"issue":"8","key":"19_CR6_19","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R. E Bryant","year":"1986","unstructured":"R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Comp., 35(8):677-691, 1986.","journal-title":"IEEE Trans. on Comp."},{"key":"19_CR7_19","doi-asserted-by":"crossref","unstructured":"J. Butler, T. Sasao, and M. Matsuura. Average path length of binary decision diagrams. IEEE Trans. on Comp., 54(9), September 2005.","DOI":"10.1109\/TC.2005.137"},{"key":"19_CR8_19","unstructured":"Collaborative Benchmarking Laboratory. 1993 LGSynth Benchmarks. North Car-olina State University, Department of Computer Science, 1993."},{"issue":"3","key":"19_CR9_19","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/43.833206","volume":"19","author":"R Drechsler","year":"2000","unstructured":"R. Drechsler, N. Drechsler, and W. G\u00fcnther. Fast exact minimization of BDDs. IEEE Trans. on CAD, 19(3):384-389, 2000.","journal-title":"IEEE Trans. on CAD"},{"issue":"3","key":"19_CR10_19","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1109\/TCAD.2004.823342","volume":"23","author":"R Drechsler","year":"2004","unstructured":"R. Drechsler, J. Shi, and G. Fey. Synthesis of fully testable circuits from BDDs. IEEE Trans. on CAD, 23(3):440-443, 2004.","journal-title":"IEEE Trans. on CAD"},{"issue":"12","key":"19_CR11_19","doi-asserted-by":"crossref","first-page":"1657","DOI":"10.1109\/TCAD.2003.819427","volume":"22","author":"R Ebendt","year":"2003","unstructured":"R. Ebendt, W. G\u00fcnther, and R. Drechsler. An improved branch and bound algorithm for exact BDD minimization. IEEE Trans. on CAD, 22(12):1657-1663, 2003.","journal-title":"IEEE Trans. on CAD"},{"key":"19_CR12_19","doi-asserted-by":"crossref","unstructured":"R. Ebendt, W. G\u00fcnther, and R. Drechsler. Minimization of the expected path length in BDDs based on local changes. In Asian and South Pacific Design Automation Conf., pages 866-871, 2004.","DOI":"10.1109\/ASPDAC.2004.1337716"},{"issue":"10","key":"19_CR13_19","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1109\/TCAD.2005.852053","volume":"24","author":"R Ebendt","year":"2005","unstructured":"R. Ebendt, W. G\u00fcnther, and R. Drechsler. Combining ordered-best first search with branch and bound for exact BDD minimization. IEEE Trans. on CAD 2005, 24(10):1515-1529, 2005.","journal-title":"IEEE Trans. on CAD 2005"},{"issue":"1","key":"19_CR14_19","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/TCAD.2005.852662","volume":"25","author":"G Fey","year":"2006","unstructured":"G. Fey and R. Drechsler. Minimizing the number of paths in BDDs -theory and algorithm. IEEE Trans. on CAD, 25(1):4-11, 2006.","journal-title":"IEEE Trans. on CAD"},{"issue":"5","key":"19_CR15_19","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1109\/12.53586","volume":"39","author":"S Friedman","year":"1990","unstructured":"S. Friedman and K. Supowit. Finding the optimal variable ordering for binary decision diagrams. IEEE Trans. on Comp., 39(5):710-713, 1990.","journal-title":"IEEE Trans. on Comp."},{"key":"19_CR16_19","doi-asserted-by":"crossref","unstructured":"M. Held and R. Karp. A dynamic programming approach to sequencing problems. J. Soc. Indust. Appl. Math., 10(1), 1962.","DOI":"10.1137\/0110015"},{"key":"19_CR17_19","doi-asserted-by":"crossref","unstructured":"Y. Iguchi, T. Sasao, and M. Matsuura. Evaluation of multiple-output logic functions using decision diagrams. In Asian South Pacific Design Automation Conf., pages 312-315, 2003.","DOI":"10.1145\/1119772.1119832"},{"key":"19_CR18_19","doi-asserted-by":"crossref","unstructured":"Y. Jiang, S. Matic, and R. Brayton. Generalized cofactoring for logic function evaluation. In Design Automation Conf., pages 155-158, 2003.","DOI":"10.1145\/775832.775873"},{"key":"19_CR19_19","doi-asserted-by":"crossref","unstructured":"P. McGeer, K. McMillan, A. Saldanha, A. Sangiovanni-Vincentelli, and P. Scaglia. Fast discrete function evaluation using decision diagrams. In Int'l Conf. on CAD, pages 402-407, 1995.","DOI":"10.1109\/ICCAD.1995.480147"},{"key":"19_CR20_19","doi-asserted-by":"crossref","unstructured":"S. Nagayama, A. Mishchenko, T. Sasao, and J. Butler. Minimization of average path length in BDDs by variable reordering. In Proc. of International Workshop on Logic and Synthesis, 2003.","DOI":"10.21236\/ADA599936"},{"key":"19_CR21_19","unstructured":"S. Nagayama and T. Sasao. On the minimization of longest path length for decision diagrams. Proc. of International Workshop on Logic and Synthesis, 2004."},{"key":"19_CR22_19","doi-asserted-by":"crossref","unstructured":"S. Reda, R. Drechsler, and A. Orailoglu. On the relation between SAT and BDDs for equivalence checking. In Int'l Symp. on Quality of Electronic Design, pages 394-399, 2002.","DOI":"10.1109\/ISQED.2002.996778"},{"key":"19_CR23_19","doi-asserted-by":"crossref","unstructured":"R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Int'l Conf. on CAD, pages 42-47, 1993.","DOI":"10.1109\/ICCAD.1993.580029"},{"key":"19_CR24_19","unstructured":"F. Somenzi. CU Decision Diagram Package Release 2.4.0. University of Colorado at Boulder, 2004."}],"container-title":["IFIP International Federation for Information Proc","Vlsi-Soc: From Systems To Silicon"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-73661-7_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,29]],"date-time":"2021-04-29T00:15:13Z","timestamp":1619655313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-73661-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387736600"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-73661-7_19","relation":{},"subject":[]}}