Frugal Encoding in Reversible $\mathcal{MOQA}$ : A Case Study for Quicksort

DOI10.1007/978-3-642-36315-3_7zbMath1451.68122OpenAlexW2155978165MaRDI QIDQ3453737

D. Early, Ang Gao, Michel 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

algorithmssortingdata structuresencodingpartial ordersQuicksortreversible computingrandom structurestime analysisMOQA language

Mathematics Subject Classification ID

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

Related Items (1)

Clean Reversible Simulations of Ranking Binary Trees

Cites Work

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

This page was built for publication: Frugal Encoding in Reversible $\mathcal{MOQA}$ : A Case Study for Quicksort