Lossless Fault-Tolerant Data Structures with Additive Overhead

We develop the first dynamic data structures that tolerate delta memory faults, lose no data, and incur only an (O) over tilde(delta) additive overhead in overall space and time per operation. We obtain such data structures for arrays, linked lists, binary search trees, interval trees, predecessor search, and suffix trees. Like previous data structures, delta must be known in advance, but we show how to restore pristine state in linear time, in parallel with queries, making delta just a bound on the rate of memory faults. Our data structures require Theta(delta) words of safe memory during an operation, which may not be theoretically necessary but seems a practical assumption.