Recursive merge sort with erroneous comparisons
type: Item
instance of: scholarly article
title: Recursive merge sort with erroneous comparisons
zbMATH Open document ID: 1228.68023
author: Petros Hadjicostas
author: K. Lakshmanan
published in: Discrete Applied Mathematics
publication date: 2011-10-27T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5964679
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: comparisons
zbMATH Keywords: errors
zbMATH Keywords: inversions
zbMATH Keywords: measures of disarray
zbMATH Keywords: runs
zbMATH Keywords: sorting
zbMATH Keywords: recursive merge sort
MaRDI profile type: Publication
full work available at URL: j.dam.2011.05.010
OpenAlex ID: W2073438146
cites work: Quicksort with Unreliable Comparisons: A Probabilistic Analysis
cites work: On sorting in the presence of erroneous information
cites work: Generating nearly sorted sequences -- the use of measures of disorder
cites work: Right invariant metrics and measures of presortedness
cites work: The price of resiliency: a case study on sorting with memory faults
cites work: Designing reliable algorithms in unreliable memories
cites work: Optimal resilient sorting and searching in the presence of memory faults
cites work: Sorting and searching in faulty memories
cites work: Q4659587
cites work: Measures of disorder and straight insertion sort with erroneous comparisons
cites work: Q5789918
cites work: Q4349924
cites work: Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults
cites work: Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults
cites work: Measures of Presortedness and Optimal Sorting Algorithms
cites work: Searching games with errors -- fifty years of coping with liars
cites work: Q4808665
cites work: Q3996430
cites work: On Fault-Tolerant Networks for Sorting
DOI: 10.1016/J.DAM.2011.05.010
Recommended article: Sorting with Recurrent Comparison Errors
Recommended article: Q4659587
Recommended article: Worst-Case Efficient Sorting with QuickMergesort
Recommended article: Correction: Parallel Merge Sort
Recommended article: Q4808665
Recommended article: Efficient unbalanced merge-sort
Recommended article: The heap-mergesort
Recommended article: Recurring Comparison Faults: Sorting and Finding the Minimum
Recommended article: Bottom-up mergesort -- A detailed analysis
description: scientific article; zbMATH DE number 5964679