A taxonomy of problems with fast parallel algorithms
Information and Control
Problems complete for deterministic logarithmic space
Journal of Algorithms
Time/space trade-offs for reversible computation
SIAM Journal on Computing
A note on Bennett's time space tradeoff for reversible computation
SIAM Journal on Computing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Reversible Simulation of Irreversible Computation
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
Undirected connectivity in O(log/sup 1.5/n) space
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Irreversibility and heat generation in the computing process
IBM Journal of Research and Development
Logical reversibility of computation
IBM Journal of Research and Development
Rush Hour is PSAPCE-complete, or "Why you should generously tip parking lot attendants"
Theoretical Computer Science
Introduction to reversible computing: motivation, progress, and challenges
Proceedings of the 2nd conference on Computing frontiers
From Reversible to Irreversible Computations
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |
This paper describes the simulation of an S(n) space-bounded deterministic Turing machine by a reversible Turing machine operating in space S(n). It thus answers a question posed by Bennett in 1989 and refutes the conjecture, made by Li and Vitanyi in 1996, that any reversible simulation of an irreversible computation must obey Bennett's reversible pebble game rules.