Inversions from sorting with distance-based errors

DOI10.1007/978-3-319-73117-9_36MaRDI QIDQ5127194zbMATH OpenOpenAlexFDO

Authors Barbara Geissmann, Paolo Penna

Publication date 21 October 2020

Published in SOFSEM 2018: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-73117-9_36

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms (68W40)

Recommendations

• Measures of disorder and straight insertion sort with erroneous comparisons
• Sorting with Recurrent Comparison Errors
• scientific article; zbMATH DE number 2147931
• On sorting in the presence of erroneous information
• Inversions in \(k\)-sorted permutations

Cited in

(6)

• Inversions in \(k\)-sorted permutations
• Sorting by swaps with noisy comparisons
• Measures of disorder and straight insertion sort with erroneous comparisons
• Energy efficient sorting, selection and searching
• Energy efficient sorting, selection and searching
• A note on finding the minimum with non-uniform comparison costs

This page was built for publication: Inversions from sorting with distance-based errors

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