Selection in the presence of memory faults, with applications to in-place resilient sorting

Keyphrases

• Resilient 100%
• Memory Faults 100%
• Selection Algorithm 50%
• Selection Problem 33%
• Time Complexity 33%
• Reliable Memory 33%
• Kd-tree 33%
• Memory Cell 33%
• Computer Science 16%
• Sorting Algorithm 16%
• Corruption 16%
• Deterministic Algorithm 16%
• Need to Know 16%
• Expected Time 16%
• Complexity Bounds 16%
• Auxiliary Input 16%
• Tail Recursion 16%
• Expected Running Time 16%
• Recursion Method 16%
• Small Elements 16%
• Algorithm Design 16%
• Recursive Algorithm 16%
• RAM Model 16%

Computer Science

• Algorithm Selection 100%
• Time Complexity 66%
• Problem Selection 66%
• Sorting Algorithm 33%
• Space Complexity 33%
• Tail-Recursion 33%
• Computer Science 33%

Mathematics

• Running Time 100%
• Worst Case 33%
• Upper Bound 33%
• Complexity Space 33%
• Smallest Element 33%
• Recursive Algorithm 33%
• Recursion Algorithm 33%