Holger Bock Axelsen & Robert Glück (2011):
A simple and efficient universal reversible Turing machine.
In: Adrian-Horia Dediu, Shunsuke Inenaga & Carlos Martín-Vide: Language and Automata Theory and Applications. Proceedings,
LNCS 6638.
Springer-Verlag,
pp. 117–128,
doi:10.1007/978-3-642-21254-3_8.
Charles H. Bennett (1973):
Logical reversibility of computation.
IBM J. Res. Dev. 17(6),
pp. 525–532,
doi:10.1147/rd.176.0525.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest & Clifford Stein (2009):
Introduction to Algorithms,
3rd edition.
MIT Press,
Cambridge, MA.
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi & Maurizio Proietti (2022):
Contract strengthening through constrained Horn clause verification.
In: HCVS/VPT'22,
pp. 23–34.
EPTCS (to appear).
Alexis De Vos (2020):
Endoreversible models for the thermodynamics of computing.
Entropy 22(6),
pp. Article 660,
doi:10.3390/e22060660.
Robert Glück & Andrei V. Klimov (1994):
Metacomputation as a tool for formal linguistic modeling.
In: Robert Trappl: Cybernetics and Systems '94 2.
World Scientific,
pp. 1563–1570.
Robert Glück & Tetsuo Yokoyama (2019):
Constructing a binary tree from its traversals by reversible recursion and iteration.
IPL 147,
pp. 32–37,
doi:10.1016/j.ipl.2019.03.002.
Robert Glück & Tetsuo Yokoyama (2022):
Reversible computing from a programming language perspective.
Theor. Comput. Sci..
In Press.
Richard M. Karp & Michael O. Rabin (1987):
Efficient randomized pattern-matching algorithms.
IBM J. Res. Dev. 31(2),
pp. 249–260,
doi:10.1147/rd.312.0249.
Marina Krakovsky (2021):
Taking the heat.
Commun. ACM 64(6),
pp. 18–20,
doi:10.1145/3460214.
Klaus-Jörn Lange, Pierre McKenzie & Alain Tapp (2000):
Reversible space equals deterministic space.
J. Comput. Syst. Sci. 60(2),
pp. 354–367,
doi:10.1006/jcss.1999.1672.
Martin Liebeck (2015):
A Concise Introduction to Pure Mathematics,
4th edition.
Chapman and Hall/CRC.
Torben Æ. Mogensen (2022):
Hermes: A reversible language for lightweight encryption.
Science of Computer Programming 215,
pp. Article 102746,
doi:10.1016/j.scico.2021.102746.
Keisuke Nakano (2022):
Time-symmetric Turing machines for computable involutions.
Science of Computer Programming 215,
pp. Article 102748,
doi:10.1016/j.scico.2021.102748.
Francisco Orts, Gloria Ortega, Elías F. Combarro & Ester M. Garzón (2020):
A review on reversible quantum adders.
J. Netw. Comput. Appl. 170,
pp. 102810,
doi:10.1016/j.jnca.2020.102810.
Tommi Pesu & Iain Phillips (2015):
Real-time methods in reversible computation.
In: Jean Krivine & Jean-Bernard Stefani: RC,
LNCS 9138.
Springer,
pp. 45–59,
doi:10.1007/978-3-319-20860-2_3.
Edwin D. Reilly, Jr. & Francis D. Federighi (1965):
On reversible subroutines and computers that run backwards.
Commun. ACM 8(9),
pp. 557–558, 578,
doi:10.1145/365559.365593.
Kaira Tanizaki, Masaki Hiraku & Tetsuo Yokoyama (2022):
Reversibilization of the naive string-match algorithm and the Rabin–Karp algorithm.
Academia. Sciences and Engineering: Journal of the Nanzan Academic Society 22(3),
pp. 124–132,
doi:10.15119/00003946.
In Japanese.
Michael Kirkedal Thomsen, Holger Bock Axelsen & Robert Glück (2012):
A reversible processor architecture and its reversible logic design.
In: Alexis De Vos & Robert Wille: RC,
LNCS 7165.
Springer-Verlag,
pp. 30–42,
doi:10.1007/978-3-642-29517-1_3.
Tetsuo Yokoyama, Holger Bock Axelsen & Robert Glück (2008):
Principles of a reversible programming language.
In: Computing Frontiers. Proceedings.
ACM Press,
pp. 43–54,
doi:10.1145/1366230.1366239.
Tetsuo Yokoyama, Holger Bock Axelsen & Robert Glück (2016):
Fundamentals of reversible flowchart languages.
Theor. Comput. Sci. 611,
pp. 87–115,
doi:10.1016/j.tcs.2015.07.046.
Tetsuo Yokoyama & Robert Glück (2007):
A reversible programming language and its invertible self-interpreter.
In: PEPM.
ACM Press,
pp. 144–153,
doi:10.1145/1244381.1244404.
eptcs@eptcs.org