Searching in the presence of linearly bounded errors
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Fault tolerant sorting networks
SIAM Journal on Discrete Mathematics
Coping with Erroneous Information While Sorting
IEEE Transactions on Computers
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
Breaking the &thgr;(nlog2n) barrier for sorting with faults
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
On optimal strategies for searching in presence of errors
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults
SIAM Journal on Computing
Searching games with errors---fifty years of coping with liars
Theoretical Computer Science
Dynamic Faults in Random-Access-Memories: Concept, Fault Models and Tests
Journal of Electronic Testing: Theory and Applications
Shared-Memory Simulations on a Faulty-Memory DMM
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
On Word-Level Parallelism in Fault-Tolerant Computing
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
A Fault-Tolerant Merge Sorting Algorithm
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Low Cost Attacks on Tamper Resistant Devices
Proceedings of the 5th International Workshop on Security Protocols
An Experimental Study of Security Vulnerabilities Caused by Errors
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Optical Fault Induction Attacks
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Using Memory Errors to Attack a Virtual Machine
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Fault tolerant data structures
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Deterministic computations on a PRAM with static processor and memory faults
Fundamenta Informaticae
Sorting and searching in the presence of memory faults (without redundancy)
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Tamper resistance: a cautionary note
WOEC'96 Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2
The price of resiliency: a case study on sorting with memory faults
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the importance of checking cryptographic protocols for faults
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Optimal resilient dynamic dictionaries
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Designing reliable algorithms in unreliable memories
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Counting in the Presence of Memory Faults
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Recursive merge sort with erroneous comparisons
Discrete Applied Mathematics
Lossless fault-tolerant data structures with additive overhead
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Experimental study of resilient algorithms and data structures
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Data structures resilient to memory faults: an experimental study of dictionaries
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Resilient algorithms and data structures
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
| Hi-index | 5.23 |
We investigate the problem of reliable computation in the presence of faults that may arbitrarily corrupt memory locations. In this framework, we consider the problems of sorting and searching in optimal time while tolerating the largest possible number of memory faults. In particular, we design an O(nlogn) time sorting algorithm that can optimally tolerate up to O(nlogn) memory faults. In the special case of integer sorting, we present an algorithm with linear expected running time that can tolerate O(n) faults. We also present a randomized searching algorithm that can optimally tolerate up to O(logn) memory faults in O(logn) expected time, and an almost optimal deterministic searching algorithm that can tolerate O((logn)^1^-^@e) faults, for any small positive constant @e, in O(logn) worst-case time. All these results improve over previous bounds.