11394 search results - page 55 / 2279 » Error-Correcting Data Structures |
SODA
2004
ACM
15 years 1 months ago
2004
ACM
We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called ret...
SODA
2001
ACM
15 years 1 months ago
2001
ACM
We address a longstanding open problem of [11, 10], and present a general transformation that transforms any pointer based data structure to be confluently persistent. Such transf...
123
click to vote
PLDI
2012
ACM
13 years 2 months ago
2012
ACM
Existing dynamic race detectors suffer from at least one of the following three limitations: (i) space overhead per memory location grows linearly with the number of parallel thre...
110
click to vote
ESOP
2008
Springer
15 years 1 months ago
2008
Springer
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
117
click to vote
FOCS
1996
IEEE
15 years 4 months ago
1996
IEEE
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. ...