Recursive merge sort with erroneous comparisons
From MaRDI portal
Publication:642963
DOI10.1016/J.DAM.2011.05.010zbMATH Open1228.68023OpenAlexW2073438146MaRDI QIDQ642963FDOQ642963
Authors: Petros Hadjicostas, K. Lakshmanan 
Publication date: 27 October 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.05.010
Recommendations
- Sorting with Recurrent Comparison Errors
- scientific article; zbMATH DE number 2147931
- Worst-case efficient sorting with QuickMergesort
- Correction: Parallel Merge Sort
- scientific article; zbMATH DE number 2089999
- Efficient unbalanced merge-sort
- The heap-mergesort
- Recurring comparison faults: sorting and finding the minimum
- Bottom-up mergesort -- A detailed analysis
errorsanalysis of algorithmssortingrunsinversionscomparisonsmeasures of disarrayrecursive merge sort
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Measures of Presortedness and Optimal Sorting Algorithms
- Searching games with errors -- fifty years of coping with liars
- Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults
- On Fault-Tolerant Networks for Sorting
- Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults
- Designing reliable algorithms in unreliable memories
- Title not available (Why is that?)
- Sorting and searching in faulty memories
- The price of resiliency: a case study on sorting with memory faults
- Optimal resilient sorting and searching in the presence of memory faults
- On sorting in the presence of erroneous information
- Right invariant metrics and measures of presortedness
- Generating nearly sorted sequences -- the use of measures of disorder
- Measures of disorder and straight insertion sort with erroneous comparisons
- Title not available (Why is that?)
- Quicksort with Unreliable Comparisons: A Probabilistic Analysis
Cited In (9)
- Optimal dislocation with persistent errors in subquadratic time
- Distribution of the sum-of-digits function of random integers: a survey
- Measures of disorder and straight insertion sort with erroneous comparisons
- Optimal Dislocation with Persistent Errors in Subquadratic Time
- Longest increasing subsequence under persistent comparison errors
- Sorting with Recurrent Comparison Errors
- Title not available (Why is that?)
- Making bubblesort recursive
- Title not available (Why is that?)
This page was built for publication: Recursive merge sort with erroneous comparisons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q642963)
