Local dependency dynamic programming in the presence of memory faults


We investigate the design of dynamic programming algorithms in unreliable memories, i.e., in the presence of faults that may arbitrarily corrupt memory locations during the algorithm execution. As a main result, we devise a general resilient framework that can be applied to all local dependency dynamic programming problems, where updates to entries in the… (More)
DOI: 10.4230/LIPIcs.STACS.2011.45
View Slides


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics