Optimizing reversible simulation of injective functions

MaRDI QIDQ5389329zbMATH OpenFDO

Authors Tetsuo Yokoyama, Holger Bock Axelsen, Robert Glück

Publication date 26 April 2012

zbMATH Keywords

Bennett's methodJanuslossless data encodingreversibilizationreversible computingreversible simulation

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Programming techniques for reversible comparison sorts
• Real-time methods in reversible computation
• A Note on Bennett’s Time-Space Tradeoff for Reversible Computation
• Clean reversible simulations of ranking binary trees
• Reversible Flowchart Languages and the Structured Reversible Program Theorem

Cited in

(8)

• A categorical foundation for structured reversible flowchart languages
• Reversible computing from a programming language perspective
• Garbageless reversible implementation of integer linear transformations
• Programming techniques for reversible comparison sorts
• A categorical foundation for structured reversible flowchart languages: soundness and adequacy
• Clean reversible simulations of ranking binary trees
• Towards clean reversible lossless compression. A reversible programming experiment with zip
• Fundamentals of reversible flowchart languages

This page was built for publication: Optimizing reversible simulation of injective functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5389329)