{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T10:34:51Z","timestamp":1763116491947,"version":"3.37.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319405773"},{"type":"electronic","value":"9783319405780"}],"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_18","type":"book-chapter","created":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T16:25:20Z","timestamp":1467217520000},"page":"239-254","source":"Crossref","is-referenced-by-count":2,"title":["Strongly Universal Reversible Gate Sets"],"prefix":"10.1007","author":[{"given":"Tim","family":"Boykett","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jarkko","family":"Kari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ville","family":"Salo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,30]]},"reference":[{"key":"18_CR1","unstructured":"Aaronson, S., Grier, D., Schaeffer, L.: The classification of reversible bit operations. Electron. Colloq. Comput. Complex. (66) (2015)"},{"key":"18_CR2","unstructured":"Boykett, T.: Closed systems of invertible maps (2015). http:\/\/arxiv.org\/abs\/1512.06813 , submitted"},{"issue":"3","key":"18_CR3","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01857727","volume":"21","author":"E Fredkin","year":"1982","unstructured":"Fredkin, E., Toffoli, T.: Conservative logic. Int. J. Theor. Phys. 21(3), 219\u2013253 (1982). http:\/\/dx.doi.org\/10.1007\/BF01857727","journal-title":"Int. J. Theor. Phys."},{"key":"18_CR4","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0022-4049(03)00069-0","volume":"184","author":"Y LaFont","year":"2003","unstructured":"LaFont, Y.: Towards an algebraic theory of boolean circuits. J. Pure Appl. Algebra 184, 257\u2013310 (2003)","journal-title":"J. Pure Appl. Algebra"},{"key":"18_CR5","unstructured":"Musset, J.: G\u00e9n\u00e9rateurs et relations pour les circuits bool\u00e9ens r\u00e9versibles. Technical report 97-32, Institut de Math\u00e9matiques de Luminy (1997). http:\/\/iml.univ-mrs.fr\/editions\/"},{"key":"18_CR6","unstructured":"Selinger, P.: Reversible k-ary logic circuits are finitely generated for odd k, April 2016. http:\/\/arxiv.org\/abs\/1604.01646"},{"key":"18_CR7","volume-title":"Clones in universal algebra, S\u00e9minaire de Math\u00e9matiques Sup\u00e9rieures [Seminar on Higher Mathematics]","author":"\u00c1 Szendrei","year":"1986","unstructured":"Szendrei, \u00c1.: Clones in universal algebra, S\u00e9minaire de Math\u00e9matiques Sup\u00e9rieures [Seminar on Higher Mathematics], vol. 99. Presses de l\u2019Universit\u00e9 de Montr\u00e9al, Montreal (1986)"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Toffoli, T.: Reversible computing. Technical report MIT\/LCS\/TM-151, MIT (1980)","DOI":"10.21236\/ADA082021"},{"key":"18_CR9","unstructured":"Xu, S.: Reversible Logic Synthesis with Minimal Usage of Ancilla Bits. Master\u2019s thesis, MIT, June 2015. http:\/\/arxiv.org\/pdf\/1506.03777.pdf"},{"issue":"44","key":"18_CR10","doi-asserted-by":"crossref","first-page":"9689","DOI":"10.1088\/0305-4470\/38\/44\/006","volume":"38","author":"G Yang","year":"2005","unstructured":"Yang, G., Song, X., Perkowski, M., Wu, J.: Realizing ternary quantum switching networks without ancilla bits. J. Phys. A 38(44), 9689\u20139697 (2005). http:\/\/dx.doi.org\/10.1088\/0305-4470\/38\/44\/006","journal-title":"J. Phys. A"}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T07:39:18Z","timestamp":1568101158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40578-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319405773","9783319405780"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40578-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}