{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T02:38:55Z","timestamp":1769827135025,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540252610","type":"print"},{"value":"9783540318347","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31834-7_20","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T14:23:40Z","timestamp":1278080620000},"page":"245-256","source":"Crossref","is-referenced-by-count":14,"title":["Classification and Universality of Reversible Logic Elements with One-Bit Memory"],"prefix":"10.1007","author":[{"given":"Kenichi","family":"Morita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsuyoshi","family":"Ogiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keiji","family":"Tanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroko","family":"Kato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"C.H. Bennett","year":"1973","unstructured":"Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev.\u00a017, 525\u2013532 (1973)","journal-title":"IBM J. Res. Dev."},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1147\/rd.321.0016","volume":"32","author":"C.H. Bennett","year":"1988","unstructured":"Bennett, C.H.: Notes on the history of reversible computation. IBM J. Res. Dev.\u00a032, 16\u201323 (1988)","journal-title":"IBM J. Res. Dev."},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01857727","volume":"21","author":"E. Fredkin","year":"1982","unstructured":"Fredkin, E., Toffoli, T.: Conservative logic. Int. J. Theoret. Phys.\u00a021, 219\u2013253 (1982)","journal-title":"Int. J. Theoret. Phys."},{"key":"20_CR4","volume-title":"Quantum Computing","author":"J. Gruska","year":"1999","unstructured":"Gruska, J.: Quantum Computing. McGraw-Hill, London (1999)"},{"key":"20_CR5","unstructured":"Lee, J., Peper, F., Adachi, S., Mashiko, S.: Asynchronously timed reversible logic elements, (submitted for publication)"},{"key":"20_CR6","first-page":"483","volume":"6","author":"K. Morita","year":"2001","unstructured":"Morita, K., Tojima, Y., Imai, K.: A simple computer embedded in a reversible and number-conserving two-dimensional cellular space. Multiple-Valued Logic\u00a06, 483\u2013514 (2001)","journal-title":"Multiple-Valued Logic"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/3-540-45132-3_6","volume-title":"Machines, Computations, and Universality","author":"K. Morita","year":"2001","unstructured":"Morita, K.: A simple universal logic element and cellular automata for reversible computing. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol.\u00a02055, pp. 102\u2013113. Springer, Heidelberg (2001)"},{"key":"20_CR8","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, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol.\u00a085, pp. 632\u2013644. Springer, Heidelberg (1980)"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/BF01752388","volume":"14","author":"T. Toffoli","year":"1981","unstructured":"Toffoli, T.: Bicontinuous extensions of invertible combinatorial functions. Mathematical Systems Theory\u00a014, 12\u201323 (1981)","journal-title":"Mathematical Systems Theory"}],"container-title":["Lecture Notes in Computer Science","Machines, Computations, and Universality"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31834-7_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:41:30Z","timestamp":1619998890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31834-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540252610","9783540318347"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31834-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}