Recurring Comparison Faults: Sorting and Finding the Minimum

DOI10.1007/978-3-319-22177-9_18zbMath1434.68746OpenAlexW1956210933MaRDI QIDQ2947883

Matúš Mihalák, Barbara Geissmann, 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

zbMATH Keywords

Kemeny distance

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Combinatorics in computer science (68R05)

Related Items (3)

The solution space of sorting with recurring comparison faults ⋮ The Solution Space of Sorting with Recurring Comparison Faults ⋮ Approximate minimum selection with unreliable comparisons

Cites Work

• Fault-tolerant search algorithms. Reliable computation with unreliable information
• Finding the maximum and minimum
• Parameterized algorithms for feedback set problems and their duals in tournaments
• Tolerant Algorithms
• Площадь обобщенного круга как функция его радиуса (I)
• Ranking Tournaments
• Aggregating inconsistent information
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recurring Comparison Faults: Sorting and Finding the Minimum