Resilient Dictionaries for Randomly Unreliable Memory

DOI10.4230/LIPICS.ESA.2019.70MaRDI QIDQ5075817zbMATH OpenOpenAlexFDO

Authors Stefano Leucci, Chih-Hung Liu, Simon Meierhans

Publication date 11 May 2022

Full work available at URL https://doi.org/10.4230/LIPIcs.ESA.2019.70

zbMATH Keywords

faulty RAMresilient dictionaryunreliable memory

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Resilient dictionaries
• Optimal Resilient Dynamic Dictionaries
• Data structures resilient to memory faults: an experimental study of dictionaries
• Resilient search trees
• Priority Queues Resilient to Memory Faults

Cites work

• Computing with Noisy Information
• Fault-tolerant search algorithms. Reliable computation with unreliable information
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 2119642 (Why is no real title available?)
• Introduction to algorithms.
• Lossless fault-tolerant data structures with additive overhead
• Noisy sorting without resampling
• On sorting in the presence of erroneous information
• Optimal dislocation with persistent errors in subquadratic time
• Optimal Resilient Dynamic Dictionaries
• Optimal resilient sorting and searching in the presence of memory faults
• Resilient dictionaries
• Searching games with errors -- fifty years of coping with liars
• Sorting and searching in faulty memories
• Sorting from Noisier Samples
• Sorting with Recurrent Comparison Errors

Cited in

(3)

• Approximate minimum selection with unreliable comparisons
• Resilient dictionaries
• Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees

This page was built for publication: Resilient Dictionaries for Randomly Unreliable Memory

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