Pages that link to "Item:Q1035681"
From MaRDI portal
The following pages link to Optimal resilient sorting and searching in the presence of memory faults (Q1035681):
Displaying 13 items.
- Resilient dynamic programming (Q513272) (← links)
- Fault-tolerant search algorithms. Reliable computation with unreliable information (Q625104) (← links)
- Recursive merge sort with erroneous comparisons (Q642963) (← links)
- Memoryless search algorithms in a network with faulty advice (Q935471) (← links)
- Sorting and searching in faulty memories (Q1006385) (← links)
- The price of resiliency: a case study on sorting with memory faults (Q1016529) (← links)
- Approximate minimum selection with unreliable comparisons (Q2072098) (← 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)
- Sorting and searching in the presence of memory faults (without redundancy) (Q3580962) (← links)
- Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting (Q4909572) (← links)
- Resilient Dictionaries for Randomly Unreliable Memory (Q5075817) (← links)
- Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees (Q6103520) (← links)