Optimal sorting with persistent comparison errors
From MaRDI portal
Publication:5075792
DOI10.4230/LIPICS.ESA.2019.49MaRDI QIDQ5075792FDOQ5075792
Authors: Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna 
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1804.07575
Recommendations
Cites Work
- Coping with errors in binary search procedures
- Title not available (Why is that?)
- Computing with Noisy Information
- Searching games with errors -- fifty years of coping with liars
- Recursive merge sort with erroneous comparisons
- Noisy sorting without resampling
- Title not available (Why is that?)
- Fault-tolerant search algorithms. Reliable computation with unreliable information
- Quicksort with Unreliable Comparisons: A Probabilistic Analysis
- Sorting with Recurrent Comparison Errors
- Parallel algorithms for select and partition with noisy comparisons
- The solution space of sorting with recurring comparison faults
- Tolerant algorithms
- Sorting from Noisier Samples
- Optimal dislocation with persistent errors in subquadratic time
Cited In (6)
- Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees
- Query-Competitive Sorting with Uncertainty.
- External-memory sorting with comparison errors
- Sorting with Recurrent Comparison Errors
- Energy efficient sorting, selection and searching
- Energy efficient sorting, selection and searching
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)
