{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:01:19Z","timestamp":1725552079954},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540332374"},{"type":"electronic","value":"9783540332381"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11732242_28","type":"book-chapter","created":{"date-parts":[[2006,3,3]],"date-time":"2006-03-03T10:12:37Z","timestamp":1141380757000},"page":"308-319","source":"Crossref","is-referenced-by-count":1,"title":["Finding Compact BDDs Using Genetic Programming"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"K\u00fchne","sequence":"first","affiliation":[]},{"given":"Nicole","family":"Drechsler","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3596-3","volume-title":"Towards One-Path Synthesis","author":"R. Drechsler","year":"2002","unstructured":"Drechsler, R., G\u00fcnther, W.: Towards One-Path Synthesis. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R. Bryant","year":"1986","unstructured":"Bryant, R.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Comp.\u00a035, 677\u2013691 (1986)","journal-title":"IEEE Trans. on Comp."},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Babai, L., Hajnal, P., Komlos, J., Pudlak, P., R\u00f6dl, V., Szemeredi, E., Turan, G.: Two lower bounds for branching programs. In: Symp. on Theory of Computing, pp. 30\u201338 (1986)","DOI":"10.1145\/12130.12134"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1109\/12.73590","volume":"40","author":"R. Bryant","year":"1991","unstructured":"Bryant, R.: On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Trans. On Comp.\u00a040, 205\u2013213 (1991)","journal-title":"IEEE Trans. On Comp."},{"key":"28_CR5","unstructured":"Becker, B., Drechsler, R., Werchner, R.: On the relation between BDDs and FDDs. Technical Report 12\/93, Universit\u00e4t Frankfurt, 12\/93, Fachbereich Informatik (1993)"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Kebschull, U., Schubert, E., Rosenstiel, W.: Multilevel logic synthesis based on functional decision diagrams. In: European Conf. on Design Automation, pp. 43\u201347 (1992)","DOI":"10.1109\/EDAC.1992.205890"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Drechsler, R., Sarabi, A., Theobald, M., Becker, B., Perkowski, M.: Efficient representation and manipulation of switching functions based on ordered Kronecker functional decision diagrams. Technical Report 14\/93, J.W.Goethe-University, Frankfurt (1993)","DOI":"10.1145\/196244.196444"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Ashar, P., Ghosh, A., Devadas, S., Newton, A.: Combinational and sequential logic verification using general binary decision diagrams. In: Int\u2019l Workshop on Logic Synth. (1991)","DOI":"10.1007\/978-1-4615-3646-8"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Rudell, R.: Dynamic variable ordering for ordered binary decision diagrams. In: Int\u2019l Workshop on Logic Synth, pp. 3a\u20131\u20133a\u201312 (1993)","DOI":"10.1109\/ICCAD.1993.580029"},{"key":"28_CR10","first-page":"364","volume":"143","author":"R. Drechsler","year":"1996","unstructured":"Drechsler, R., Becker, B., G\u00f6ckel, N.: A genetic algorithm for variable ordering of OBDDs. IEE Proceedings\u00a0143, 364\u2013368 (1996)","journal-title":"IEE Proceedings"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Sakanashi, H., Higuchi, T., Iba, H., Kakazu, Y.: Evolution of binary decision diagrams for digital circuit design using genetic programming. In: ICES, pp. 470\u2013481 (1996)","DOI":"10.1007\/3-540-63173-9_66"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1109\/12.537122","volume":"45","author":"B. Bollig","year":"1996","unstructured":"Bollig, B., Wegener, I.: Improving the variable ordering of OBDDs is NP-complete. IEEE Trans. on Comp.\u00a045, 993\u20131002 (1996)","journal-title":"IEEE Trans. on Comp."},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0166-218X(03)00297-X","volume":"138","author":"I. Wegener","year":"2004","unstructured":"Wegener, I.: Bdds \u2013 design, analysis, complexity, and applications. Discrete Applied Mathematics\u00a0138, 229\u2013251 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Friedman, S., Supowit, K.: Finding the optimal variable ordering for binary decision diagrams. In: Design Automation Conf., pp. 348\u2013356 (1987)","DOI":"10.1145\/37888.37941"},{"key":"28_CR15","unstructured":"Buch, P., Narayan, A., Newton, A., Sangiovanni-Vincentelli, A.: On synthesizing pass transistor networks. In: Int\u2019l Workshop on Logic Synth. (1997)"},{"key":"28_CR16","unstructured":"Ferrandi, F., Macii, A., Macii, E., Poncino, M., Scarsi, R., Somenzi, F.: Layoutoriented synthesis of PTL circuits based on BDDs. In: Int\u2019l Workshop on Logic Synth., pp. 514\u2013519 (1998)"},{"key":"28_CR17","volume-title":"Genetic Programming - On the Programming of Computers by means of Natural Selection","author":"J. Koza","year":"1992","unstructured":"Koza, J.: Genetic Programming - On the Programming of Computers by means of Natural Selection. MIT Press, Cambridge (1992)"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Keijzer, M., Merelo, J.J., Schoenauer, G.R., Evolving, M.: objects: a general purpose evolutionary computation library. Evolution Artificielle (2001)","DOI":"10.1007\/3-540-46033-0_19"},{"key":"28_CR19","unstructured":"Somenzi, F.: CUDD: CU Decision Diagram Package Release 2.4.0. University of Colorado at Boulder (2004)"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11732242_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:52:21Z","timestamp":1619491941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11732242_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540332374","9783540332381"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11732242_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}