Resilient dynamic programming

DOI10.1007/S00453-015-0073-ZMaRDI QIDQ513272zbMATH OpenOpenAlexFDO

Authors Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, Francesco Silvestri

Publication date 3 March 2017

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11577/3228321

zbMATH Keywords

dynamic programmingcache-oblivious algorithmsGaussian elimination paradigmmemory faultsresilient computing

Mathematics Subject Classification ID

Dynamic programming (90C39) Nonnumerical algorithms (68W05)

Recommendations

• Dynamic programming in faulty memory hierarchies (cache-obliviously)
• Local dependency dynamic programming in the presence of memory faults
• Designing reliable algorithms in unreliable memories
• Resilient algorithms and data structures
• Algorithms – ESA 2005

Cites work

• scientific article; zbMATH DE number 1003301 (Why is no real title available?)
• Algorithms and data structures for external memory
• Algorithms on Strings, Trees and Sequences
• Braking the (n^ 2 n) barrier for sorting with faults
• Cache-oblivious algorithms
• Cache-oblivious dynamic programming
• Checking and Spot-Checking the Correctness of Priority Queues
• Checking the correctness of memories
• Comparison-based search in the presence of errors
• Computer Aided Verification
• Computing with Noisy Information
• Counting in the presence of memory faults
• Data structures resilient to memory faults: an experimental study of dictionaries
• Dynamic programming in faulty memory hierarchies (cache-obliviously)
• Efficient randomized pattern-matching algorithms
• Error-correcting data structures
• Exploiting non-constant safe memory in resilient algorithms and data structures
• Fault Tolerant External Memory Algorithms
• Fault Tolerant Sorting Networks
• Local dependency dynamic programming in the presence of memory faults
• Lossless fault-tolerant data structures with additive overhead
• Oblivious algorithms for multicores and networks of processors
• Optimal Resilient Dynamic Dictionaries
• Optimal resilient sorting and searching in the presence of memory faults
• Priority Queues Resilient to Memory Faults
• Probabilistic algorithm for testing primality
• Resilient \(k\)-d trees: \(k\)-means in space revisited
• Resilient dictionaries
• Resilient quicksort and selection
• Searching games with errors -- fifty years of coping with liars
• Selection in the presence of memory faults, with applications to in-place resilient sorting
• Sorting and searching in faulty memories
• The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation
• The price of resiliency: a case study on sorting with memory faults

Cited in

(3)

• Local dependency dynamic programming in the presence of memory faults
• Dynamic programming in faulty memory hierarchies (cache-obliviously)
• Designing reliable algorithms in unreliable memories

This page was built for publication: Resilient dynamic programming

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