TY - GEN
T1 - Fault-Tolerant Data Structures
AU - Aumann, Y.
AU - Bender, M. A.
N1 - Place of conference:Burlington, VT
PY - 1996
Y1 - 1996
N2 - The authors consider the tolerance of data structures to memory faults. They observe that many pointer-based data structures (e.g. linked lists, trees, etc.) are highly nonresilient to faults. A single fault in a linked list or tree may result in the loss of the entire set of data. They 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
AB - The authors consider the tolerance of data structures to memory faults. They observe that many pointer-based data structures (e.g. linked lists, trees, etc.) are highly nonresilient to faults. A single fault in a linked list or tree may result in the loss of the entire set of data. They 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
UR - http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=548517&newsearch=true&queryText=Fault-Tolerant%20Data%20Structures
M3 - Conference contribution
BT - 37th Annual Symposium, on the Foundations of Computer Science (FOCS)
PB - IEEE
ER -