Paper by Erik D. Demaine

Reference:

Paul Christiano, Erik D. Demaine, and Shaunak Kishore, “Lossless Fault-Tolerant Data Structures with Additive Overhead”, in Proceedings of the 12th Algorithms and Data Structures Symposium (WADS 2011), Brooklyn, New York, August 15–17, 2011, pages 243–254.

BibTeX

@InProceedings{FaultTolerant_WADS2011,
  AUTHOR        = {Paul Christiano and Erik D. Demaine and Shaunak Kishore},
  TITLE         = {Lossless Fault-Tolerant Data Structures with Additive Overhead},
  BOOKTITLE     = {Proceedings of the 12th Algorithms and Data Structures
                   Symposium (WADS 2011)},
  bookurl       = {http://www.wads.org/},
  ADDRESS       = {Brooklyn, New York},
  MONTH         = {August 15--17},
  YEAR          = 2011,
  PAGES         = {243--254},

  length        = {12 pages},
  withstudent   = 1,
  doi           = {https://dx.doi.org/10.1007/978-3-642-22300-6_21},
  dblp          = {https://dblp.org/rec/conf/wads/ChristianoDK11},
  comments      = {This paper is also available from <A HREF="https://doi.org/10.1007/978-3-642-22300-6_21">SpringerLink</A>.},
}

Abstract:

We develop the first dynamic data structures that tolerate δ memory faults, lose no data, and incur only an Õ(δ) additive overhead in overall space and time per operation. We obtain such data structures for arrays, linked lists, binary search trees, interval trees, predecessor search, and suffix trees. Like previous data structures, δ must be known in advance, but we show how to restore pristine state in linear time, in parallel with queries, making δ just a bound on the rate of memory faults. Our data structures require Θ(δ) words of safe memory during an operation, which may not be theoretically necessary but seems a practical assumption.

Comments:

This paper is also available from SpringerLink.

Length:

The paper is 12 pages.

Availability:

The paper is available in PDF (206k).

See information on file formats.

[Google Scholar search]