Research in the area of fault-tolerant distributed systems has focused to a large extent on data surviving various forms of failure. The replica control algorithms for maintaining mutually consistent replicas abound in number. However, comparatively little work has been devoted to making processes recoverable. In domains other than databases and transaction processing, faulttolerance generally ...

In a distributed system using rollback recovery, information saved on stable storage during failure-free execution allows certain states of each process to be restored after a failure. For example, in a system of deterministic processes using message logging and checkpointing, a process state can be restored only if all messages received by the process since its previous checkpoint have been lo...

We construct a family of linear maximally recoverable codes with locality $r$ and dimension $r+1.$ For length $n$ $r\approx n^\alpha, 0\le\alpha\le 1$ the code alphabet is order $n^{1+3\alpha},$ which improves upon previously known constructions codes.

In this paper, we investigate the recoverable robust knapsack problem, where the uncertainty of the item weights follows the approach of Bertsimas and Sim [3, 4]. In contrast to the robust approach, a limited recovery action is allowed, i.e., upto k items may be removed when the actual weights are known. This problem is motivated by the assignment of traffic nodes to antennas in wireless networ...