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
Fault tolerant sorting networks
SIAM Journal on Discrete Mathematics
Testing semiconductor memories: theory and practice
Testing semiconductor memories: theory and practice
Checking the correctness of memories
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Coping with Erroneous Information While Sorting
IEEE Transactions on Computers
On playing “Twenty Questions” with a liar
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A survey of adaptive sorting algorithms
ACM Computing Surveys (CSUR)
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
Fault-tolerant computer system design
Fault-tolerant computer system design
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
Best sorting algorithm for nearly sorted lists
Communications of the ACM
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)
PRAM Computations Resilient to Memory Faults
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Optical Fault Induction Attacks
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Experimental evaluation of the fail-silent behaviour in programs with consistency checks
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
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
Assessing Fault Sensitivity in MPI Applications
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Soft Errors in Advanced Computer Systems
IEEE Design & Test
Proceedings of the 12th ACM conference on Computer and communications security
Tamper resistance: a cautionary note
WOEC'96 Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2
Failure trends in a large disk drive population
FAST '07 Proceedings of the 5th USENIX conference on File and Storage Technologies
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
Algorithm-Based Fault Tolerance for Matrix Operations
IEEE Transactions on Computers
Exterminator: Automatically correcting memory errors with high probability
Communications of the ACM - Surviving the data deluge
Sorting and Searching in Faulty Memories
Algorithmica
Fault Tolerant External Memory Algorithms
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Optimal resilient sorting and searching in the presence of memory faults
Theoretical Computer Science
Counting in the Presence of Memory Faults
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Reliability challenges in large systems
Future Generation Computer Systems
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
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
Designing reliable algorithms in unreliable memories
Computer Science Review
Priority queues resilient to memory faults
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Max algorithms in crowdsourcing environments
Proceedings of the 21st international conference on World Wide Web
| Hi-index | 0.00 |
Modern memory devices may suffer from faults, where some bits may arbitrarily flip and corrupt the values of the affected memory cells. The appearance of such faults may seriously compromise the correctness and performance of computations. In recent years, many algorithms for computing in the presence of memory faults have been introduced in the literature: in particular, an algorithm or a data structure is called resilient if it is able to work correctly on the set of uncorrupted values. In this invited talk I will survey recent work on resilient algorithms and data structures.