Pages that link to "Item:Q458451"
From MaRDI portal
The following pages link to Designing reliable algorithms in unreliable memories (Q458451):
Displaying 12 items.
- Resilient dynamic programming (Q513272) (← links)
- Recursive merge sort with erroneous comparisons (Q642963) (← links)
- Reliable computing with unreliable components: Using separable environments to stabilize long-term information storage (Q933430) (← links)
- The price of resiliency: a case study on sorting with memory faults (Q1016529) (← links)
- Exploiting non-constant safe memory in resilient algorithms and data structures (Q2342685) (← links)
- On the error resilience of ordered binary decision diagrams (Q2354761) (← links)
- Dynamic programming in faulty memory hierarchies (cache-obliviously) (Q2911644) (← links)
- Local dependency dynamic programming in the presence of memory faults (Q3113671) (← links)
- Fault Tolerant External Memory Algorithms (Q3183472) (← links)
- Resilient Algorithms and Data Structures (Q3562988) (← links)
- Dependability Aspects Regarding the Cache Level of a Memory Hierarchy using Hamming Codes (Q4930321) (← links)
- Algorithmic Building Blocks for Asymmetric Memories (Q5009607) (← links)