Optimal Resilient Sorting and Searching in the Presence of 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… (More)
DOI: 10.1007/11786986_26

3 Figures and Tables


  • Presentations referencing similar topics