|
|
|
|
| LEADER |
01730 am a22002533u 4500 |
| 001 |
73856 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Christiano, Paul F.
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
|e contributor
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
|e contributor
|
| 100 |
1 |
0 |
|a Christiano, Paul F.
|e contributor
|
| 100 |
1 |
0 |
|a Demaine, Erik D.
|e contributor
|
| 100 |
1 |
0 |
|a Kishore, Shaunak
|e contributor
|
| 700 |
1 |
0 |
|a Demaine, Erik D.
|e author
|
| 700 |
1 |
0 |
|a Kishore, Shaunak
|e author
|
| 245 |
0 |
0 |
|a Lossless fault-tolerant data structures with additive overhead
|
| 260 |
|
|
|b Springer Berlin / Heidelberg,
|c 2012-10-10T17:33:11Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/73856
|
| 520 |
|
|
|a 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings
|
| 520 |
|
|
|a We develop the first dynamic data structures that tolerate δ memory faults, lose no data, and incur only an O(δ ) 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.
|
| 520 |
|
|
|a Center for Massive Data Algorithmics (MADALGO)
|
| 546 |
|
|
|a en_US
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t Algorithms and Data Structures
|
