Approximate minimum selection with unreliable comparisons
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5485441 (Why is no real title available?)
- scientific article; zbMATH DE number 4033104 (Why is no real title available?)
- scientific article; zbMATH DE number 7650297 (Why is no real title available?)
- Comparison-based search in the presence of errors
- Competitive analysis of the top-\(K\) ranking problem
- Computing with Noisy Information
- Coping with errors in binary search procedures
- Fault-tolerant search algorithms. Reliable computation with unreliable information
- Finding the maximum and minimum
- Noisy sorting without resampling
- On sorting in the presence of erroneous information
- Optimal dislocation with persistent errors in subquadratic time
- Optimal resilient sorting and searching in the presence of memory faults
- Parallel algorithms for select and partition with noisy comparisons
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- Recurring comparison faults: sorting and finding the minimum
- Resilient Dictionaries for Randomly Unreliable Memory
- Searching games with errors -- fifty years of coping with liars
- Searching with known error probability
- Sorting noisy data with partial information
- Sorting with Recurrent Comparison Errors
- Staircase series
- Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults
- Tolerant algorithms
Cited in
(4)
This page was built for publication: Approximate minimum selection with unreliable comparisons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2072098)
