{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:09Z","timestamp":1759638549253},"reference-count":12,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1051\/ita:2004008","type":"journal-article","created":{"date-parts":[[2004,5,25]],"date-time":"2004-05-25T15:50:51Z","timestamp":1085500251000},"page":"137-161","source":"Crossref","is-referenced-by-count":5,"title":["Time and space complexity of reversible pebbling"],"prefix":"10.1051","volume":"38","author":[{"given":"Richard","family":"Kr\u00e1lovi\u010d","sequence":"first","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2004,6,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1137\/0218053","volume":"18","author":"Bennett","year":"1989","journal-title":"SIAM J. Comput."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"H. Buhrman, J. Tromp and P. Vit\u00e1nyi, Time and space bounds for reversible simulation, inProc. ICALP 2001. Springer-Verlag,Lect. Notes Comput. Sci.2076(2001).","DOI":"10.1007\/3-540-48224-5_82"},{"key":"R3","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/0219046","volume":"19","author":"Levine","year":"1990","journal-title":"SIAM J. Comput."},{"key":"R4","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/S0167-2789(98)00052-9","volume":"120","author":"Li","year":"1998","journal-title":"Physica D"},{"key":"R5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1098\/rspa.1996.0001","volume":"452","author":"Li","year":"1996","journal-title":"Proc. Roy. Soc. Lond. Ser. A"},{"key":"R6","unstructured":"M. Li and P.M.B. Vit\u00e1nyi, Reversible simulation of irreversible computation, inProc. 11th IEEE Conf. Computational Complexity, Philadelphia, Pennsylvania, May 24-27 (1996)."},{"key":"R7","unstructured":"M.S. Paterson and C.E. Hewitt, Comparative Schematology, inMAC Conf. on Concurrent Systems and Parallel Computation(1970) 119-127."},{"key":"R8","unstructured":"P. Ru\u017ei\u010dka, Pebbling \u2013 The Technique for Analysing Computation Efficiency.SOFSEM'89(1989) 205-224."},{"key":"R9","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1051\/ita\/1994280605571","volume":"28","author":"Ru\u017ei\u010dka","year":"1994","journal-title":"RAIRO-Inf. Theor. Appl."},{"key":"R10","first-page":"671","volume":"711","author":"Ru\u017ei\u010dka","year":"1993","journal-title":"MFCS'93"},{"key":"R11","unstructured":"R. Williams,Space-Efficient Reversible Simulations. DIMACS REU report (July 2000)."},{"key":"R12","unstructured":"A. Zavarsk\u00fd,On the Cost of Reversible Computations: Time-Space Bounds on Reversible Pebbling. Manuscript (1998)."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2004008\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T07:30:51Z","timestamp":1585812651000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2004008"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":12,"journal-issue":{"issue":"2"},"alternative-id":["ita0227"],"URL":"https:\/\/doi.org\/10.1051\/ita:2004008","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}