References
- Bennett, C. 1973. “Logical Reversibility of Computation.” IBM Journal of Research and Development 17: 525–532.
- Bennett, C. 1982. “The Thermodynamics of Computation – A Review.” International Journal of Theoretical Physics 21: 905–940.
- Bennett, C. 1989. “Time/Space Trade-offs for Reversible Computation.” SIAM Journal on Computing 18: 766–776.
- Landauer, R. 1961. “Irreversibility and Heat Generation in the Computing Process.” IBM Journal of Research and Development 5: 183–191.
- Lange, K. J., P. McKenzie, and A. Tapp. 2000. “Reversible Space Equals Deterministic Space.” The Journal of Computer and System Sciences 60: 354–367.
- Lecerf, Y. 1963. “Machines de Turing réversibles – récursive insolubilité en n ϵ N de l’équation u = θn u, où θ est un isomorphisme de codes.” Comptes Rendus Hebdomadaires des Séances de L’académie des Sciences 257: 2597–2600.
- Lewis, H., and C. Papadimitriou. 1982. “Symmetric Space-bounded Computation.” Theoretical Computer Science 19: 161–187.
- Morita, K. 2011. “Two-way Reversible Multi-head Finite Automata.” Fundamenta Informaticae 110: 241–254.
- Morita, K. 2013. “A Deterministic Two-way Multi-head Finite Automaton can be Converted into a Reversible One with the Same Number of Heads.” In Proc. RC 2012 LNCS 7581, 29–43.
- Reingold, O. 2008. “Undirected Connectivity in Log-space.” Journal of the ACM 55: 1–24.