Sorting algorithms in \textsc{MOQA}

DOI10.1016/J.ENTCS.2008.12.088MaRDI QIDQ4982076zbMATH OpenOpenAlexFDO

Authors Jacinta Townley, Manning Joseph, M. Schellekens

Publication date 23 March 2015

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2008.12.088

zbMATH Keywords

analysis of algorithmsaverage casepartial orderquicksortrandomness preservationsorting

Mathematics Subject Classification ID

Theory of programming languages (68N15) Data structures (68P05) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• Functionally-generalised \textsc{MOQA} operations
• \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis
• Reconstruction of partial orders and list representation as random structures
• A random bag preserving product operation
• Frugal encoding in reversible \(\mathcal{MOQA}\): a case study for Quicksort

Cites work

• Automatic average-case analysis of algorithms
• Computer Aided Verification
• Deletions That Preserve Randomness
• scientific article; zbMATH DE number 3821741 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3508512 (Why is no real title available?)
• scientific article; zbMATH DE number 1178950 (Why is no real title available?)
• scientific article; zbMATH DE number 4115969 (Why is no real title available?)
• scientific article; zbMATH DE number 815575 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Implementing Quicksort programs
• Introduction to algorithms
• Quicksort
• Quicksort with Equal Keys

Cited in

(7)

• \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis
• An introduction to three algorithms for sorting in situ
• Frugal encoding in reversible \(\mathcal{MOQA}\): a case study for Quicksort
• Running time of the treapsort algorithm
• A random bag preserving product operation
• Functionally-generalised \textsc{MOQA} operations
• Reconstruction of partial orders and list representation as random structures

Describes a project that uses

Uses Software

• Quicksort

This page was built for publication: Sorting algorithms in \textsc{MOQA}

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