Pages that link to "Item:Q1006385"
From MaRDI portal
The following pages link to Sorting and searching in faulty memories (Q1006385):
Displaying 15 items.
- Designing reliable algorithms in unreliable memories (Q458451) (← links)
- Recall searching with and without recall (Q490064) (← links)
- Resilient dynamic programming (Q513272) (← links)
- Fault-tolerant search algorithms. Reliable computation with unreliable information (Q625104) (← links)
- Recursive merge sort with erroneous comparisons (Q642963) (← links)
- Checking the correctness of memories (Q890427) (← links)
- The price of resiliency: a case study on sorting with memory faults (Q1016529) (← links)
- Optimal resilient sorting and searching in the presence of memory faults (Q1035681) (← links)
- Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm (Q1040789) (← 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)
- Resilient Algorithms and Data Structures (Q3562988) (← links)
- Resilient Dictionaries for Randomly Unreliable Memory (Q5075817) (← links)
- Energy efficient sorting, selection and searching (Q6091161) (← links)
- Energy efficient sorting, selection and searching (Q6548954) (← links)