11219 search results - page 37 / 2244 » Retroactive data structures |
103
click to vote
PLDI
2012
ACM
13 years 5 days 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...
ESOP
2008
Springer
14 years 11 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...
101
click to vote
FOCS
1996
IEEE
15 years 1 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. ...
DBPL
1999
Springer
15 years 2 months ago
1999
Springer
Applications have an increasing need to manage semistructured data such as data encoded in XML along with conventional structured data. We extend the structured object database ...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This paper presents a general technique for optimally transforming any dynamic data structure D that operates on atomic and indivisible keys by constant-time comparisons,...