Fault-Tolerant Data Structures

Y. Aumann; M. A. Bender

Fault-Tolerant Data Structures

Y. Aumann
, M. A. Bender

Department of Computer Science and Artificial Intelligence

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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

Original language	American English
Title of host publication	37th Annual Symposium, on the Foundations of Computer Science (FOCS)
Publisher	IEEE
State	Published - 1996

Bibliographical note

Place of conference:Burlington, VT

Cite this

@inproceedings{57f1f2367f7640a183188b448d823339,

title = "Fault-Tolerant Data Structures",

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",

author = "Y. Aumann and Bender, \{M. A.\}",

note = "Place of conference:Burlington, VT",

year = "1996",

language = "American English",

booktitle = "37th Annual Symposium, on the Foundations of Computer Science (FOCS)",

publisher = "IEEE",

}

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 -

Fault-Tolerant Data Structures

Abstract

Bibliographical note

Other files and links

Fingerprint

Cite this