Programming Techniques for Reversible Comparison Sorts

DOI10.1007/978-3-319-26529-2_22zbMath1329.68090OpenAlexW2404268124MaRDI QIDQ3459428

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

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

Related Items (4)

On reversible Turing machines and their function universality ⋮ Clean Reversible Simulations of Ranking Binary Trees ⋮ Reversible computing from a programming language perspective ⋮ Unnamed Item

This page was built for publication: Programming Techniques for Reversible Comparison Sorts