Searching with known error probability
Theoretical Computer Science
Searching in the presence of linearly bounded errors
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
On playing “Twenty Questions” with a liar
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Comparison-based search in the presence of errors
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Computing with Noisy Information
SIAM Journal on Computing
On optimal strategies for searching in presence of errors
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Searching games with errors---fifty years of coping with liars
Theoretical Computer Science
Introduction to Algorithms
Dynamic Faults in Random-Access-Memories: Concept, Fault Models and Tests
Journal of Electronic Testing: Theory and Applications
Fault tolerant data structures
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Combinatorial algorithms for web search engines: three success stories
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A dichromatic framework for balanced trees
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Sorting and Searching in Faulty Memories
Algorithmica
Optimal resilient dynamic dictionaries
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Optimal resilient sorting and searching in the presence of memory faults
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Priority queues resilient to memory faults
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Lossless fault-tolerant data structures with additive overhead
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
ESA'11 Proceedings of the 19th European conference on Algorithms
Experimental study of resilient algorithms and data structures
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
| Hi-index | 0.00 |
We address the problem of designing data structures in the presence of faults that may arbitrarily corrupt memory locations. More precisely, we assume that an adaptive adversary can arbitrarily overwrite the content of up to δ memory locations, that corrupted locations cannot be detected, and that only O(1) memory locations are safe. In this framework, we call a data structure resilient if it is able to operate correctly (at least) on the set of uncorrupted values. We present a resilient dictionary, implementing search, insert, and delete operations. Our dictionary has O(log n + δ) expected amortized time per operation, and O(n) space complexity, where n denotes the current number of keys in the dictionary. We also describe a deterministic resilient dictionary, with the same amortized cost per operation over a sequence of at least δ&epsis; operations, where &epsis; 0 is an arbitrary constant. Finally, we show that any resilient comparison-based dictionary must take Ω(log n + δ) expected time per search. Our results are achieved by means of simple, new techniques which might be of independent interest for the design of other resilient algorithms.