Fault-Tolerance and Complexity

Lane A. Hemachandra · 1993

Robust computation---a radical approach to fault-tolerant database access---was explicitly defined one decade ago, and in the following year this notion was presented at ICALP in Antwerp. A decade's study of robust computation by many researchers has determined which problems can be fault-tolerantly solved via access to databases of many strengths. This paper surveys these results and mentions some interesting unresolved issues.

Read the paper · More papers on PaperTik