Tolerant algorithms

DOI10.1007/978-3-642-23719-5_62MaRDI QIDQ3092276zbMATH OpenOpenAlexFDO

Authors Rolf Klein, Rainer Penninger, Christian Sohler, David P. Woodruff

Publication date 16 September 2011

Published in Algorithms – ESA 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-23719-5_62

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Optimal dislocation with persistent errors in subquadratic time
• Optimal resilient sorting and searching in the presence of memory faults
• Optimal Resilient Sorting and Searching in the Presence of Memory Faults
• Optimal dislocation with persistent errors in subquadratic time
• Sorting and searching in faulty memories

Cited in

(8)

• Recurring comparison faults: sorting and finding the minimum
• Optimal dislocation with persistent errors in subquadratic time
• Optimal dislocation with persistent errors in subquadratic time
• Maximum selection and sorting with adversarial comparators
• Optimal sorting with persistent comparison errors
• External-memory sorting with comparison errors
• Sorting with Recurrent Comparison Errors
• Approximate minimum selection with unreliable comparisons

This page was built for publication: Tolerant algorithms

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