Optimal dislocation with persistent errors in subquadratic time

DOI10.4230/LIPICS.STACS.2018.36MaRDI QIDQ3304135zbMATH OpenOpenAlexFDO

Authors Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna

Publication date 5 August 2020

Full work available at URL https://dblp.uni-trier.de/db/conf/stacs/stacs2018.html#Geissmann0LP18

zbMATH Keywords

maximum dislocationrecurrent comparison errorssorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms (68W40)

Recommendations

• Optimal dislocation with persistent errors in subquadratic time
• Sorting with Recurrent Comparison Errors
• On sorting in the presence of erroneous information
• Recurring comparison faults: sorting and finding the minimum
• Tolerant algorithms

Cites work

• Computing with Noisy Information
• Fault-tolerant search algorithms. Reliable computation with unreliable information
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• Noisy sorting without resampling
• Ordering by weighted number of wins gives a good ranking for weighted tournaments
• Quicksort with Unreliable Comparisons: A Probabilistic Analysis
• Recursive merge sort with erroneous comparisons
• Searching games with errors -- fifty years of coping with liars
• The solution space of sorting with recurring comparison faults
• Tolerant algorithms

Cited in

(5)

• On sorting in the presence of erroneous information
• Optimal dislocation with persistent errors in subquadratic time
• Tolerant algorithms
• Optimal sorting with persistent comparison errors
• Resilient Dictionaries for Randomly Unreliable Memory

This page was built for publication: Optimal dislocation with persistent errors in subquadratic time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3304135)