(Enter summary)
Abstract: We prove a general upper bound on the tradeoff between time and space that suffices
for the reversible simulation of irreversible computation. Previously, only simulations
using exponential time or quadratic space were known. The tradeoff shows for the first
time that we can simultaneously achieve subexponential time and subquadratic space.
The boundary values are the exponential time with hardly any extra space required
by the Lange-McKenzie-Tapp method and the (log 3)th power time with... (Update)
Cited by: More
Fault Testing for Reversible Circuits - Ketan Patel John
(Correct)
Generic Quantum Block Compression - John Langford April
(Correct)
Similar documents (at the sentence level):
25.4%: Reversible Simulation of Irreversible Computation - Li, Tromp, Vitanyi (1996)
(Correct)
16.1%: Analysis of Reversible Simulation of Irreversible.. - Li, Tromp.. (1997)
(Correct)
5.3%: Information Distance - Bennett, Gács, Li.. (1997)
(Correct)
Active bibliography (related documents): More All
0.4: Reversible Space Equals Deterministic Space - Lange, McKenzie, Tapp (1998)
(Correct)
0.3: Relativized Separation of Reversible and Irreversible.. - Frank, Ammer (2001)
(Correct)
0.3: Rush Hour is PSPACE-complete, or "Why you should.. - Gary Flake, Eric Baum
(Correct)
Similar documents based on text: More All
1.7: A Structural Approach to Reversible Computation - Abramsky (2001)
(Correct)
0.4: Space-Efficient Reversible Simulations - Williams (2000)
(Correct)
0.1: Clustering by Compression - Cilibrasi, Vitanyi
(Correct)
BibTeX entry: (Update)
H. Buhrman, J. Tromp, P. Vitanyi, Time and Space Bounds for Reversible Simulation, Proc. International Conference on Automata, Languages and Programming, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2001. http://citeseer.ist.psu.edu/buhrman01time.html More
@article{ buhrman01time,
author = "Harry Buhrman and John Tromp and Paul Vit{\'a}nyi",
title = "Time and Space Bounds for Reversible Simulation",
journal = "Lecture Notes in Computer Science",
volume = "2076",
pages = "1017--??",
year = "2001",
url = "citeseer.ist.psu.edu/buhrman01time.html" }
Citations (may not include all citations):
175
Logical reversibility of computation (context) - Bennett - 1973
167
Quantum Computation and Quantum Information (context) - Nielsen, Chuang - 2000
164
Polynomial-time algorithms for prime factorization and discr..
- Shor - 1997
86
Conservative logic (context) - Fredkin, Toffoli - 1982
75
Irreversibility and heat generation in the computing process (context) - Landauer - 1961
59
The thermodynamics of computation---a review (context) - Bennett - 1982
19
A note on Bennett's time-space tradeoff for reversible compu.. (context) - Levine, Sherman - 1990
18
Halting space-bounded computation (context) - Sipser - 1990
18
Reversibility and adiabatic computation: trading time and sp..
- Li, Vit'anyi - 1996
15
Time-space tradeoffs for reversible computation (context) - Bennett - 1989
9
Reversible space equals deterministic space
- Lange, McKenzie et al. - 2000
9
Reversible simulation of irreversible computation
- Li, Tromp et al. - 1998
6
Separations of reversible and irreversible space-time comple.. (context) - Frank, Ammer
5
Reversibility in optimally scalable computer architectures
- Frank, Knight et al. - 1997
5
tape 2-symbol reversible Turing machine (context) - Morita, Shirasaki et al. - 1989
Documents on the same site (http://www.cwi.nl/~paulv/publications.html): More
Randomized Naming Using Wait-Free Shared Variables - Panconesi, Papatriantafilou, .. (1998)
(Correct)
On Two-Tape Real-Time Computation and Queues - Vitányi
(Correct)
A Discipline of Evolutionary Programming - Vitányi (1996)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC