Optimal sorting with persistent comparison errors
From MaRDI portal
(Redirected from Publication:5075792)
Recommendations
Cites work
- Computing with Noisy Information
- Coping with errors in binary search procedures
- Fault-tolerant search algorithms. Reliable computation with unreliable information
- scientific article; zbMATH DE number 3547240 (Why is no real title available?)
- scientific article; zbMATH DE number 3205803 (Why is no real title available?)
- Noisy sorting without resampling
- Optimal dislocation with persistent errors in subquadratic time
- Parallel algorithms for select and partition with noisy comparisons
- Quicksort with Unreliable Comparisons: A Probabilistic Analysis
- Recursive merge sort with erroneous comparisons
- Searching games with errors -- fifty years of coping with liars
- Sorting from Noisier Samples
- Sorting with Recurrent Comparison Errors
- The solution space of sorting with recurring comparison faults
- Tolerant algorithms
Cited in
(9)- Query-Competitive Sorting with Uncertainty.
- Sorting with Recurrent Comparison Errors
- Energy efficient sorting, selection and searching
- Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees
- External-memory sorting with comparison errors
- Energy efficient sorting, selection and searching
- Approximate selection with unreliable comparisons in sublinear time
- Computational geometry with probabilistically noisy primitive operations
- Robust-sorting and applications to Ulam-median
This page was built for publication: Optimal sorting with persistent comparison errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075792)
