Recurring comparison faults: sorting and finding the minimum
From MaRDI portal
Publication:2947883
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 3639144 (Why is no real title available?)
- Aggregating inconsistent information: ranking and clustering
- Fault-tolerant search algorithms. Reliable computation with unreliable information
- Finding the maximum and minimum
- Noisy binary search and its applications
- Noisy sorting without resampling
- Parameterized algorithms for feedback set problems and their duals in tournaments
- Ranking Tournaments
- Tolerant algorithms
- Площадь обобщенного круга как функция его радиуса (I)
Cited in
(7)- Optimal dislocation with persistent errors in subquadratic time
- Optimal dislocation with persistent errors in subquadratic time
- The solution space of sorting with recurring comparison faults
- Recursive merge sort with erroneous comparisons
- Sorting with Recurrent Comparison Errors
- The solution space of sorting with recurring comparison faults
- Approximate minimum selection with unreliable comparisons
This page was built for publication: Recurring comparison faults: sorting and finding the minimum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947883)