Coping with Erroneous Information While Sorting
IEEE Transactions on Computers
On sorting in the presence of erroneous information
Information Processing Letters
Comparison-based search in the presence of errors
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Introduction to Algorithms
SORTING AND SEARCHING WITH A FAULTY COMPARISON ORACLE
SORTING AND SEARCHING WITH A FAULTY COMPARISON ORACLE
Sorting and searching in the presence of memory faults (without redundancy)
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Optimal resilient sorting and searching in the presence of memory faults
Theoretical Computer Science
Counting in the Presence of Memory Faults
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Recursive merge sort with erroneous comparisons
Discrete Applied Mathematics
Designing reliable algorithms in unreliable memories
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Experimental study of resilient algorithms and data structures
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Resilient algorithms and data structures
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Designing reliable algorithms in unreliable memories
Computer Science Review
Priority queues resilient to memory faults
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
Sorting based on pairwise key comparisons is one of the most widely studied problems. We consider the problem of comparison based sorting in which some of the outcomes of comparisons can be faulty. We show how to modify merge-sorting to (nearly optimally) sort in the presence of faults. More specifically, we show that there is a variation of merge-sort that can sort n records with O(n log n) comparisons when upto e = 驴( log n/log log n ) comparisons are faulty.