Programming techniques for reversible comparison sorts

DOI10.1007/978-3-319-26529-2_22MaRDI QIDQ3459428zbMATH OpenOpenAlexFDO

Authors Holger Bock Axelsen, Tetsuo Yokoyama

Publication date 8 January 2016

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-26529-2_22

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Searching and sorting (68P10)

Recommendations

• Optimizing reversible simulation of injective functions
• Reversible Flowchart Languages and the Structured Reversible Program Theorem
• What do reversible programs compute?
• Fundamentals of reversible flowchart languages
• Time/Space Trade-Offs for Reversible Computation

Cited in

(8)

• Reversible computing from a programming language perspective
• On reversible Turing machines and their function universality
• Frugal encoding in reversible \(\mathcal{MOQA}\): a case study for Quicksort
• Clean reversible simulations of ranking binary trees
• Optimizing reversible simulation of injective functions
• Towards a dereversibilizer: fewer asserts, statically
• scientific article; zbMATH DE number 7806139 (Why is no real title available?)
• Towards clean reversible lossless compression. A reversible programming experiment with zip

This page was built for publication: Programming techniques for reversible comparison sorts

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