Resilient search trees

MaRDI QIDQ2934637zbMATH OpenFDO

Authors Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano

Publication date 18 December 2014

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Recommendations

• Optimal Resilient Dynamic Dictionaries
• Resilient dictionaries
• Lossless fault-tolerant data structures with additive overhead
• Sorting and searching in faulty memories
• Optimal resilient sorting and searching in the presence of memory faults

Cited in

(16)

• Sorting and searching in faulty memories
• The price of resiliency: a case study on sorting with memory faults
• Optimal resilient sorting and searching in the presence of memory faults
• On the error resilience of ordered binary decision diagrams
• Fault Tolerant External Memory Algorithms
• Optimal Resilient Dynamic Dictionaries
• Resilient algorithms and data structures
• Priority Queues Resilient to Memory Faults
• Designing reliable algorithms in unreliable memories
• Searching a Tree with Permanently Noisy Advice
• Resilient Dictionaries for Randomly Unreliable Memory
• Data structures resilient to memory faults: an experimental study of dictionaries
• Lossless fault-tolerant data structures with additive overhead
• Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees
• Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees
• The query complexity of searching trees with permanently noisy advice

This page was built for publication: Resilient search trees

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