{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T16:01:10Z","timestamp":1781366470357,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,13]],"date-time":"2010-06-13T00:00:00Z","timestamp":1276387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["DR 287\/20-1"],"award-info":[{"award-number":["DR 287\/20-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,13]]},"DOI":"10.1145\/1837274.1837439","type":"proceedings-article","created":{"date-parts":[[2010,10,28]],"date-time":"2010-10-28T14:47:40Z","timestamp":1288277260000},"page":"647-652","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":44,"title":["Reducing the number of lines in reversible circuits"],"prefix":"10.1145","author":[{"given":"Robert","family":"Wille","sequence":"first","affiliation":[{"name":"University of Bremen, Bremen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mathias","family":"Soeken","sequence":"additional","affiliation":[{"name":"University of Bremen, Bremen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rolf","family":"Drechsler","sequence":"additional","affiliation":[{"name":"University of Bremen, Bremen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"3457","article-title":"Elementary gates for quantum computation","volume":"52","author":"Barenco A.","year":"1995","unstructured":"A. Barenco , C. H. Bennett , R. Cleve , D. DiVinchenzo , N. Margolus , P. Shor , T. Sleator , J. Smolin , and H. Weinfurter . Elementary gates for quantum computation . The American Physical Society , 52 : 3457 -- 3467 , 1995 . A. Barenco, C. H. Bennett, R. Cleve, D. DiVinchenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter. Elementary gates for quantum computation. The American Physical Society, 52:3457--3467, 1995.","journal-title":"The American Physical Society"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.176.0525"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-9260(02)00051-2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACRIM.2007.4313212"},{"key":"e_1_3_2_1_5_1","volume-title":"Int'l Reed-Muller Workshop","author":"Goodman D.","year":"2007","unstructured":"D. Goodman , M. A. Thornton , D. Y. Feinstein , and D. M. Miller . Quantum logic circuit simulation based on the QMDD data structure . In Int'l Reed-Muller Workshop , 2007 . D. Goodman, M. A. Thornton, D. Y. Feinstein, and D. M. Miller. Quantum logic circuit simulation based on the QMDD data structure. In Int'l Reed-Muller Workshop, 2007."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2017215"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.871622"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.53.0183"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1049\/el:20031202"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.836735"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/775832.775915"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL.2010.48"},{"key":"e_1_3_2_1_13_1","volume-title":"Quantum Computation and Quantum Information","author":"Nielsen M.","year":"2000","unstructured":"M. Nielsen and I. Chuang . Quantum Computation and Quantum Information . Cambridge Univ. Press , 2000 . M. Nielsen and I. Chuang. Quantum Computation and Quantum Information. Cambridge Univ. Press, 2000."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.831576"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL.2005.46"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ATS.2005.9"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2003.811448"},{"key":"e_1_3_2_1_18_1","first-page":"632","volume-title":"Reversible computing","author":"Toffoli T.","unstructured":"T. Toffoli . Reversible computing . In W. de Bakker and J. van Leeuwen, editors, Automata, Languages and Programming , page 632 . Springer, 1980. Technical Memo MIT\/LCS\/TM-151, MIT Lab. for Comput. Sci. T. Toffoli. Reversible computing. In W. de Bakker and J. van Leeuwen, editors, Automata, Languages and Programming, page 632. Springer, 1980. Technical Memo MIT\/LCS\/TM-151, MIT Lab. for Comput. Sci."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1038\/414883a"},{"key":"e_1_3_2_1_20_1","first-page":"69","volume-title":"Int'l Conf. on CAD","author":"Viamontes G. F.","year":"2007","unstructured":"G. F. Viamontes , I. L. Markov , and J. P. Hayes . Checking equivalence of quantum circuits and states . In Int'l Conf. on CAD , pages 69 -- 74 , 2007 . G. F. Viamontes, I. L. Markov, and J. P. Hayes. Checking equivalence of quantum circuits and states. In Int'l Conf. on CAD, pages 69--74, 2007."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1119772.1119829"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e91-a.2.584"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629911.1629984"},{"key":"e_1_3_2_1_24_1","first-page":"1284","volume-title":"Automation and Test in Europe","author":"Wille R.","year":"2009","unstructured":"R. Wille , D. Gro\u00dfe , S. Frehse , G. W. Dueck , and R. Drechsler . Debugging of Toffoli networks. In Design , Automation and Test in Europe , pages 1284 -- 1289 , 2009 . R. Wille, D. Gro\u00dfe, S. Frehse, G. W. Dueck, and R. Drechsler. Debugging of Toffoli networks. In Design, Automation and Test in Europe, pages 1284--1289, 2009."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL.2009.19"},{"key":"e_1_3_2_1_26_1","volume-title":"Int'l Workshop on Logic Synth.","author":"Wille R.","year":"2010","unstructured":"R. Wille , S. Offermann , and R. Drechsler . SyReC: A programming language for synthesis of reversible circuits . In Int'l Workshop on Logic Synth. , 2010 . R. Wille, S. Offermann, and R. Drechsler. SyReC: A programming language for synthesis of reversible circuits. In Int'l Workshop on Logic Synth., 2010."}],"event":{"name":"DAC '10: The 47th Annual Design Automation Conference 2010","location":"Anaheim California","acronym":"DAC '10","sponsor":["EDAC Electronic Design Automation Consortium","SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA"]},"container-title":["Proceedings of the 47th Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1837274.1837439","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1837274.1837439","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:36Z","timestamp":1750246776000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1837274.1837439"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,13]]},"references-count":26,"alternative-id":["10.1145\/1837274.1837439","10.1145\/1837274"],"URL":"https:\/\/doi.org\/10.1145\/1837274.1837439","relation":{},"subject":[],"published":{"date-parts":[[2010,6,13]]},"assertion":[{"value":"2010-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}