The Community for Technology Leaders
Proceedings of 37th Conference on Foundations of Computer Science (1996)
Burlington, VT
Oct. 14, 1996 to Oct. 16, 1996
ISBN: 0-8186-7594-2
pp: 580
Y. Aumann , Dept. of Math. & Comput. Sci., Bar-Ilan Univ., Ramat-Gan, Israel
M.A. Bender , Dept. of Math. & Comput. Sci., Bar-Ilan Univ., Ramat-Gan, Israel
ABSTRACT
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.
INDEX TERMS
tree data structures; fault tolerant data structures; memory faults; pointer-based data structures; linked list; trees; stack; dictionary tree
CITATION

Y. Aumann and M. Bender, "Fault tolerant data structures," Proceedings of 37th Conference on Foundations of Computer Science(FOCS), Burlington, VT, 1996, pp. 580.
doi:10.1109/SFCS.1996.548517
92 ms
(Ver 3.3 (11022016))