Frugal encoding in reversible MOQA: a case study for Quicksort

DOI10.1007/978-3-642-36315-3_7MaRDI QIDQ3453737zbMATH OpenOpenAlexFDO

Authors D. Early, Ang Gao, M. Schellekens

Publication date 30 November 2015

Published in Reversible Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36315-3_7

zbMATH Keywords

algorithmsdata structuresencodingMOQA languagepartial ordersQuicksortrandom structuresreversible computingsortingtime analysis

Mathematics Subject Classification ID

Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Sorting algorithms in \textsc{MOQA}
• Programming techniques for reversible comparison sorts
• \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis
• Functionally-generalised \textsc{MOQA} operations
• Towards a reversible functional language

Cites work

• \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis
• Complexity of multi-head finite automata: origins and directions
• Logical Reversibility of Computation

Cited in

(3)

• Sorting algorithms in \textsc{MOQA}
• Functionally-generalised \textsc{MOQA} operations
• Clean reversible simulations of ranking binary trees

This page was built for publication: Frugal encoding in reversible \(\mathcal{MOQA}\): a case study for Quicksort

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