{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:08Z","timestamp":1759638308240},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_82","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T02:29:04Z","timestamp":1193538544000},"page":"1017-1027","source":"Crossref","is-referenced-by-count":22,"title":["Time and Space Bounds for Reversible Simulation"],"prefix":"10.1007","author":[{"given":"Harry","family":"Buhrman","sequence":"first","affiliation":[]},{"given":"John","family":"Tromp","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Vit\u00e1nyi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"82_CR1","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"C.H. Bennett","year":"1973","unstructured":"C.H. Bennett. Logical reversibility of computation. IBM J. Res. Develop., 17:525\u2013532, 1973.","journal-title":"IBM J. Res. Develop."},{"key":"82_CR2","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1007\/BF02084158","volume":"21","author":"C.H. Bennett","year":"1982","unstructured":"C.H. Bennett. The thermodynamics of computation\u2014a review. Int. J. Theoret. Phys., 21(1982), 905\u2013940.","journal-title":"Int. J. Theoret. Phys."},{"key":"82_CR3","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1137\/0218053","volume":"18","author":"C.H. Bennett","year":"1989","unstructured":"C.H. Bennett. Time-space tradeoffs for reversible computation. SIAM J. Comput., 18(1989), 766\u2013776.","journal-title":"SIAM J. Comput."},{"key":"82_CR4","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01857727","volume":"21","author":"E. Fredkin","year":"1982","unstructured":"E. Fredkin and T. Toffoli. Conservative logic. Int. J. Theoret. Phys., 21(1982),219\u2013253.","journal-title":"Int. J. Theoret. Phys."},{"unstructured":"M. Frank, T. Knight, and N. Margolus, Reversibility in optimally scalable computer architectures, Manuscript, MIT-LCS, 1997 \/\/\n                    http:\/\/www.ai.mit.edu\/~mpf\/publications.html\n                    \n                  .","key":"82_CR5"},{"unstructured":"M.P. Frank and M.J. Ammer, Separations of reversible and irreversible space-time complexity classes, Submitted. \/\/\n                    http:\/\/www.ai.mit.edu\/~mpf\/rc\/memos\/M06_oracle.html\n                    \n                  .","key":"82_CR6"},{"key":"82_CR7","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1147\/rd.321.0024","volume":"32","author":"R.W. Keyes","year":"1988","unstructured":"R.W. Keyes, IBM J. Res. Dev., 32(1988), 24\u201328.","journal-title":"IBM J. Res. Dev."},{"key":"82_CR8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1147\/rd.53.0183","volume":"5","author":"R. Landauer","year":"1961","unstructured":"R. Landauer. Irreversibility and heat generation in the computing process. IBM J. Res. Develop., 5:183\u2013191, 1961.","journal-title":"IBM J. Res. Develop."},{"issue":"2","key":"82_CR9","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1006\/jcss.1999.1672","volume":"60","author":"K.J. Lange","year":"2000","unstructured":"K.J. Lange, P. McKenzie, and A. Tapp, Reversible space equals deterministic space, J. Comput. System Sci., 60:2(2000), 354\u2013367.","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"82_CR10","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1137\/0219046","volume":"19","author":"R.Y. Levine","year":"1990","unstructured":"R.Y. Levine and A.T. Sherman, A note on Bennett\u2019s time-space tradeoff for reversible computation, SIAM J. Comput., 19:4(1990), 673\u2013677.","journal-title":"SIAM J. Comput."},{"key":"82_CR11","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1098\/rspa.1996.0039","volume":"452","author":"M. Li","year":"1996","unstructured":"M. Li and P.M.B. Vit\u00e1nyi, Reversibility and adiabatic computation: trading time and space for energy, Proc. Royal Society of London, Series A, 452(1996), 769\u2013789.","journal-title":"Proc. Royal Society of London"},{"key":"82_CR12","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/S0167-2789(98)00052-9","volume":"120","author":"M. Li","year":"1998","unstructured":"M. Li, J. Tromp, and P. Vit\u00e1nyi, Reversible simulation of irreversible computation. Physica D, 120(1998) 168\u2013176.","journal-title":"Physica D"},{"key":"82_CR13","first-page":"223","volume":"E72","author":"K. Morita","year":"1989","unstructured":"K. Morita, A. Shirasaki, and Y. Gono, A 1-tape 2-symbol reversible Turing machine, IEEE Trans. IEICE, E72 (1989), 223\u2013228.","journal-title":"IEEE Trans. IEICE"},{"unstructured":"M. Nielsen, I. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2000.","key":"82_CR14"},{"issue":"5","key":"82_CR15","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"P.W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput., 26:5(1997), 1484\u20131509.","journal-title":"SIAM J. Comput."},{"key":"82_CR16","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0304-3975(80)90053-5","volume":"10","author":"M. Sipser","year":"1990","unstructured":"M. Sipser, Halting space-bounded computation, Theoret. Comp. Sci., 10(1990), 335\u2013338.","journal-title":"Theoret. Comp. Sci."},{"unstructured":"R. Williams, Space-Efficient Reversible Simulations, DIMACS REU report, July 2000. \n                    http:\/\/dimacs.rutgers.edu\/~ryanw\/","key":"82_CR17"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_82","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T14:08:05Z","timestamp":1551017285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_82","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}