Resilient Dictionaries for Randomly Unreliable Memory

DOI10.4230/LIPIcs.ESA.2019.70OpenAlexW2977528225MaRDI QIDQ5075817

Simon Meierhans, Stefano Leucci, Chih-Hung Liu

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)

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fault-tolerant search algorithms. Reliable computation with unreliable information
• Sorting and searching in faulty memories
• Optimal resilient sorting and searching in the presence of memory faults
• On sorting in the presence of erroneous information
• Resilient dictionaries
• Optimal Dislocation with Persistent Errors in Subquadratic Time
• Optimal Resilient Dynamic Dictionaries
• Computing with Noisy Information
• Sorting from Noisier Samples
• Sorting with Recurrent Comparison Errors
• Lossless Fault-Tolerant Data Structures with Additive Overhead
• Searching games with errors -- fifty years of coping with liars

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