Recurring comparison faults: sorting and finding the minimum
From MaRDI portal
Publication:2947883
DOI10.1007/978-3-319-22177-9_18zbMATH Open1434.68746OpenAlexW1956210933MaRDI QIDQ2947883FDOQ2947883
Authors: Barbara Geissmann, Matúš Mihalák, Peter Widmayer 
Publication date: 29 September 2015
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-22177-9_18
Recommendations
Combinatorics in computer science (68R05) Analysis of algorithms (68W40) Searching and sorting (68P10)
Cites Work
- Title not available (Why is that?)
- Aggregating inconsistent information: ranking and clustering
- Title not available (Why is that?)
- Ranking Tournaments
- Title not available (Why is that?)
- Parameterized algorithms for feedback set problems and their duals in tournaments
- Noisy binary search and its applications
- Noisy sorting without resampling
- Fault-tolerant search algorithms. Reliable computation with unreliable information
- Finding the maximum and minimum
- 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)
