Designing reliable algorithms in unreliable memories
From MaRDI portal
Publication:458451
Recommendations
Cites work
- scientific article; zbMATH DE number 1003301 (Why is no real title available?)
- scientific article; zbMATH DE number 3547240 (Why is no real title available?)
- scientific article; zbMATH DE number 1149908 (Why is no real title available?)
- scientific article; zbMATH DE number 1979271 (Why is no real title available?)
- scientific article; zbMATH DE number 1998328 (Why is no real title available?)
- scientific article; zbMATH DE number 742943 (Why is no real title available?)
- scientific article; zbMATH DE number 2089999 (Why is no real title available?)
- scientific article; zbMATH DE number 2102780 (Why is no real title available?)
- scientific article; zbMATH DE number 2119642 (Why is no real title available?)
- Automata, Languages and Programming
- Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults
- Cache-oblivious priority queue and graph algorithm applications
- Checking the correctness of memories
- Combinatorial algorithms for web search engines -- three success stories
- Comparison-based search in the presence of errors
- Computer Aided Verification
- Computing with Noisy Information
- Coping with errors in binary search procedures
- Fault Tolerant Sorting Networks
- Introduction to algorithms
- On Fault-Tolerant Networks for Sorting
- On word-level parallelism in fault-tolerant computing
- Optimal Resilient Dynamic Dictionaries
- Optimal Resilient Sorting and Searching in the Presence of Memory Faults
- Priority Queues Resilient to Memory Faults
- Resilient search trees
- Searching games with errors -- fifty years of coping with liars
- Searching with known error probability
- Sorting and searching in the presence of memory faults (without redundancy)
- The Price of Resiliency: A Case Study on Sorting with Memory Faults
- Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults
Cited in
(14)- On the error resilience of ordered binary decision diagrams
- Algorithmic Building Blocks for Asymmetric Memories
- Dependability Aspects Regarding the Cache Level of a Memory Hierarchy using Hamming Codes
- Fault Tolerant External Memory Algorithms
- Local dependency dynamic programming in the presence of memory faults
- Resilient algorithms and data structures
- Recursive merge sort with erroneous comparisons
- The price of resiliency: a case study on sorting with memory faults
- Dynamic programming in faulty memory hierarchies (cache-obliviously)
- Algorithms – ESA 2005
- Exploiting non-constant safe memory in resilient algorithms and data structures
- Reliable computing with unreliable components: Using separable environments to stabilize long-term information storage
- Resilient dynamic programming
- On the inherent resilience of integer operations
This page was built for publication: Designing reliable algorithms in unreliable memories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458451)
