Fault Tolerant Data Structures

We study the tolerance of data structures to memory faults. We observe that many pointerbased data structures (e.g., linked lists, trees, etc.) are highly nonresilient to faults. A single fault in a pointer in a linked list or a tree may result in the loss of an unproportionately large amount of data. In this paper we present a formal framework for studying the fault-tolerance properties of pointer-based data structures, and provide fault-tolerant versions of the stack, the linked list, and the dictionary tree.

• Type: Conference
• Year: 1996
• Where: FOCS
• Authors: Yonatan Aumann, Michael A. Bender
• Keywords: Data Structures, FOCS 1996, Linked List, Pointerbased Data Structures, Theoretical Computer Science