Optimal resilient sorting and searching in the presence of dynamic memory faults

We investigate the problem of reliable computation in the presence of faults that may arbitrarily corrupt memory locations. In this framework, we consider the problems of sorting and searching in optimal time while tolerating the largest possible number of memory faults. In particular, we design an O(n log n) time sorting algorithm that can optimally tolerate up to O(sqrt(n log n)) memory faults. In the special case of integer sorting, we present an algorithm with linear expected running time that can tolerate O(sqrt(n))faults. We also present a randomized searching algorithm that can optimally tolerate up to O(log n) memory faults in O(log n) expected time, and an almost optimal deterministic searching algorithm that can tolerate O((log n)^(1?eps)) faults, for any small positive constant eps, in O(log n) worst-case time. All these results improve over previous bounds.