{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:35:15Z","timestamp":1774370115784,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319405773","type":"print"},{"value":"9783319405780","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40578-0_23","type":"book-chapter","created":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T20:25:20Z","timestamp":1467231920000},"page":"322-337","source":"Crossref","is-referenced-by-count":5,"title":["Checking Reversibility of Boolean Functions"],"prefix":"10.1007","author":[{"given":"Robert","family":"Wille","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aaron","family":"Lye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Niemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,30]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Amar\u00fa, L., Gaillardon, P.E., Wille, R., De Micheli, G.: Exploiting inherent characteristics of reversible circuits for faster combinational equivalence checking. In: Design, Automation and Test in Europe (2016, to appear)","DOI":"10.3850\/9783981537079_0152"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Athas, W., Svensson, L.: Reversible logic issues in adiabatic CMOS. In: Proceedings of Workshop on Physics and Computation PhysComp 1994, pp. 111\u2013118 (1994)","DOI":"10.1109\/PHYCMP.1994.363692"},{"key":"23_CR3","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1038\/nature10872","volume":"483","author":"A Berut","year":"2012","unstructured":"Berut, A., Arakelyan, A., Petrosyan, A., Ciliberto, S., Dillenschneider, R., Lutz, E.: Experimental verification of Landauer\u2019s principle linking information and thermodynamics. Nature 483, 187\u2013189 (2012)","journal-title":"Nature"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Brand, D.: Verification of large synthesized designs. In: International Conference on CAD, pp. 534\u2013537 (1993)","DOI":"10.1109\/ICCAD.1993.580110"},{"issue":"8","key":"23_CR5","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comp. 35(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comp."},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Cook, S.: The complexity of theorem-proving procedures. In: Symposium on Theory of Computing, pp. 151\u2013158. ACM (1971). http:\/\/doi.acm.org\/10.1145\/800157.805047","DOI":"10.1145\/800157.805047"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Fazel, K., Thornton, M., Rice, J.: ESOP-based Toffoli gate cascade generation. In: IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PacRim 2007), pp. 206\u2013209. IEEE (2007)","DOI":"10.1109\/PACRIM.2007.4313212"},{"key":"23_CR9","unstructured":"Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: International Joint Conference on Artificial Intelligence, pp. 386\u2013392 (2007)"},{"issue":"5","key":"23_CR10","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1109\/TCAD.2009.2017215","volume":"28","author":"D Gro\u00dfe","year":"2009","unstructured":"Gro\u00dfe, D., Wille, R., Dueck, G.W., Drechsler, R.: Exact multiple control Toffoli network synthesis with SAT techniques. IEEE Trans. CAD 28(5), 703\u2013715 (2009)","journal-title":"IEEE Trans. CAD"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Theory of Computing, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/978-3-642-38986-3_4","volume-title":"Reversible Computation","author":"S Houri","year":"2013","unstructured":"Houri, S., Valentian, A., Fanet, H.: Comparing CMOS-based and NEMS-based adiabatic logic circuits. In: Dueck, G.W., Miller, D.M. (eds.) RC 2013. LNCS, vol. 7948, pp. 36\u201345. Springer, Heidelberg (2013)"},{"issue":"1","key":"23_CR13","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1088\/0957-4484\/4\/1\/002","volume":"4","author":"RC Merkle","year":"1993","unstructured":"Merkle, R.C.: Reversible electronic logic using switches. Nanotechnology 4(1), 21\u201340 (1993)","journal-title":"Nanotechnology"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Miller, D.M., Maslov, D., Dueck, G.W.: A transformation based algorithm for reversible logic synthesis. In: Design Automation Confernce, pp. 318\u2013323 (2003)","DOI":"10.1109\/DAC.2003.1219016"},{"key":"23_CR15","volume-title":"Quantum Computation and Quantum Information","author":"M Nielsen","year":"2000","unstructured":"Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"issue":"3","key":"23_CR16","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1109\/TASC.2009.2018250","volume":"19","author":"J Ren","year":"2009","unstructured":"Ren, J., Semenov, V., Polyakov, Y., Averin, D., Tsai, J.S.: Progress towards reversible computing with nSQUID arrays. IEEE Trans. Appl. Supercond. 19(3), 961\u2013967 (2009)","journal-title":"IEEE Trans. Appl. Supercond."},{"issue":"4","key":"23_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1877745.1877747","volume":"6","author":"M Saeedi","year":"2010","unstructured":"Saeedi, M., Zamani, M.S., Sedighi, M., Sasanian, Z.: Synthesis of reversible circuit using cycle-based approach. J. Emerg. Technol. Comput. Syst. 6(4), 1\u201326 (2010)","journal-title":"J. Emerg. Technol. Comput. Syst."},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. Foundations of Computer Science, pp. 124\u2013134 (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"23_CR19","doi-asserted-by":"crossref","first-page":"41: 1","DOI":"10.1016\/j.jsc.2015.03.002","volume":"73","author":"M Soeken","year":"2016","unstructured":"Soeken, M., Tague, L., Dueck, G.W., Drechsler, R.: Ancilla-free synthesis of large reversible functions using binary decision diagrams. J. Symb. Comput. 73, 41: 1\u201341: 26 (2016). http:\/\/dx.doi.org\/10.1016\/j.jsc.2015.03.002","journal-title":"J. Symb. Comput."},{"key":"23_CR20","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: ASP Design Automation Conference, pp. 85\u201392 (2012)","DOI":"10.1109\/ASPDAC.2012.6165069"},{"issue":"4","key":"23_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2786982","volume":"12","author":"M Soeken","year":"2015","unstructured":"Soeken, M., Wille, R., Keszocze, O., Miller, D.M., Drechsler, R.: Embedding of large Boolean functions for reversible logic. J. Emerg. Technol. Comput. Syst. 12(4), 1\u201326 (2015). http:\/\/doi.acm.org\/10.1145\/2786982","journal-title":"J. Emerg. Technol. Comput. Syst."},{"issue":"2","key":"23_CR22","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s100090100042","volume":"3","author":"F Somenzi","year":"2001","unstructured":"Somenzi, F.: Efficient manipulation of decision diagrams. Softw. Tools Technol. Transf. 3(2), 171\u2013181 (2001)","journal-title":"Softw. Tools Technol. Transf."},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/978-3-642-34407-7_10","volume-title":"Implementation and Application of Functional Languages","author":"MK Thomsen","year":"2012","unstructured":"Thomsen, M.K.: Describing and optimising reversible logic using a functional language. In: Gill, A., Hage, J. (eds.) IFL 2011. LNCS, vol. 7257, pp. 148\u2013163. Springer, Heidelberg (2012)"},{"key":"23_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1007\/3-540-10003-2_104","volume-title":"Automata, Languages and Programming","author":"T Toffoli","year":"1980","unstructured":"Toffoli, T.: Reversible computing. In: de Bakker, W., van Leeuwen, J. (eds.) Automata, Languages and Programming. LNCS, vol. 85, pp. 632\u2013644. Springer, Heidelberg (1980)"},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Wille, R., Drechsler, R.: BDD-based synthesis of reversible logic for large functions. In: Design Automation Conference, pp. 270\u2013275 (2009)","DOI":"10.1145\/1629911.1629984"},{"key":"23_CR26","unstructured":"Wille, R., Gro\u00dfe, D., Teuber, L., Dueck, G.W., Drechsler, R.: RevLib: an online resource for reversible functions and reversible circuits. In: International Symposyum on Multi-Valued Logic, pp. 220\u2013225 (2008). http:\/\/www.revlib.org"},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Wille, R., Kesz\u00f6cze, O., Drechsler, R.: Determining the minimal number of lines for large reversible circuits. In: Design, Automation and Test in Europe, pp. 1204\u20131207. IEEE (2011)","DOI":"10.1109\/DATE.2011.5763314"},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Wille, R., Drechsler, R., Osewold, C., Garcia-Ortiz, A.: Automatic design of low-power encoders using reversible circuit synthesis. In: Design, Automation and Test in Europe, pp. 1036\u20131041. IEEE (2012)","DOI":"10.1109\/DATE.2012.6176648"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40578-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T23:14:43Z","timestamp":1748992483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40578-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319405773","9783319405780"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40578-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}