On the expected performance of path compression algorithms
SIAM Journal on Computing
On selecting the largest element in spite of erroneous information
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Solution of Ulam's problem on searching with a lie
Journal of Combinatorial Theory Series A
Comparison-based search in the presence of errors
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Searching games with errors---fifty years of coping with liars
Theoretical Computer Science
A Fault-Tolerant Merge Sorting Algorithm
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
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
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 | 14.98 |
The authors study the problem of sorting n distinct elements in ascending sequence according to a total order, using comparison queries which receive 'yes' or 'no' answers, but of which as many as e may be erroneous. In a half-lie version, all 'yes' answers are guaranteed to be correct and the errors are confined to 'no' answers. It is shown that the comparison query complexity of the sorting problem for this case is Omega (n log n+e), and an asymptotically optimal algorithm is demonstrated. In a full-lie version, both 'yes' and 'no' answers can be false. It is shown that the comparison query complexity of the sorting problem for this case is Omega (n log n+en).