{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:20Z","timestamp":1740099140181,"version":"3.37.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319994970"},{"type":"electronic","value":"9783319994987"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-99498-7_17","type":"book-chapter","created":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T04:45:39Z","timestamp":1534826739000},"page":"244-250","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["QMDD-Based One-Pass Design of Reversible Logic: Exploring the Available Degree of Freedom (Work-in-Progress Report)"],"prefix":"10.1007","author":[{"given":"Alwin","family":"Zulehner","sequence":"first","affiliation":[]},{"given":"Robert","family":"Wille","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,22]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Kozlowski, T., Dagless, E.L., Saul, J.M.: An enhanced algorithm for the minimization of exclusive-or sum-of-products for incompletely specified functions. In: International Conference on Computer Design, pp. 244\u2013249 (1995)","DOI":"10.1109\/ICCD.1995.528817"},{"key":"17_CR2","unstructured":"Mishchenko, A., Perkowski, M.: Fast heuristic minimization of exclusive-sums-of-products. In: International Workshop on Applications of the Reed-Muller Expansion in Circuit Design, pp. 242\u2013250 (2001)"},{"issue":"1","key":"17_CR3","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1109\/TCAD.2015.2459034","volume":"35","author":"P Niemann","year":"2016","unstructured":"Niemann, P., Wille, R., Miller, D.M., Thornton, M.A., Drechsler, R.: QMDDs: efficient quantum function representation and manipulation. IEEE Trans. CAD Integr. Circ. Syst. 35(1), 86\u201399 (2016)","journal-title":"IEEE Trans. CAD Integr. Circ. Syst."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Soeken, M., Wille, R., Hilken, C., Przigoda, N., Drechsler, R.: Synthesis of reversible circuits with minimal lines for large functions. In: Asia and South Pacific Design Automation Conference, pp. 85\u201392 (2012)","DOI":"10.1109\/ASPDAC.2012.6165069"},{"issue":"4","key":"17_CR5","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1109\/43.494702","volume":"15","author":"N Song","year":"1996","unstructured":"Song, N., Perkowski, M.A.: Minimization of exclusive sum-of-products expressions for multiple-valued input, incompletely specified functions. IEEE Trans. CAD Integr. Circ. Syst. 15(4), 385\u2013395 (1996)","journal-title":"IEEE Trans. CAD Integr. Circ. Syst."},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Zulehner, A., Wille, R.: Improving synthesis of reversible circuits: Exploiting redundancies in paths and nodes of QMDDs. In: International Conference of Reversible Computation, pp. 232\u2013247 (2017)","DOI":"10.1007\/978-3-319-59936-6_18"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Zulehner, A., Wille, R.: Make it reversible: efficient embedding of non-reversible functions. In: Design, Automation and Test in Europe, pp. 458\u2013463 (2017)","DOI":"10.23919\/DATE.2017.7927033"},{"issue":"5","key":"17_CR8","first-page":"996","volume":"37","author":"A Zulehner","year":"2018","unstructured":"Zulehner, A., Wille, R.: One-pass design of reversible circuits: combining embedding and synthesis for reversible logic. IEEE Trans. CAD Integr. Circ. Syst. 37(5), 996\u20131008 (2018)","journal-title":"IEEE Trans. CAD Integr. Circ. Syst."}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99498-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T04:55:18Z","timestamp":1534827318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99498-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319994970","9783319994987"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99498-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}