Resilient dynamic programming
From MaRDI portal
Publication:513272
DOI10.1007/S00453-015-0073-ZzbMath1359.68287OpenAlexW2137088392MaRDI QIDQ513272
Emanuele G. Fusco, Irene Finocchi, Saverio Caminiti, 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
dynamic programmingcache-oblivious algorithmsGaussian elimination paradigmmemory faultsresilient computing
Cites Work
- Unnamed Item
- Unnamed Item
- The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation
- Checking the correctness of memories
- Oblivious algorithms for multicores and networks of processors
- 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
- Probabilistic algorithm for testing primality
- Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults
- Resilient \(k\)-d trees: \(k\)-means in space revisited
- Exploiting non-constant safe memory in resilient algorithms and data structures
- Error-Correcting Data Structures
- Algorithms and Data Structures for External Memory
- Resilient Quicksort and Selection
- Dynamic programming in faulty memory hierarchies (cache-obliviously)
- Resilient dictionaries
- Fault Tolerant External Memory Algorithms
- Cache-Oblivious Algorithms
- Optimal Resilient Dynamic Dictionaries
- Cache-oblivious dynamic programming
- Priority Queues Resilient to Memory Faults
- Sorting and Selection with Imprecise Comparisons
- Counting in the Presence of Memory Faults
- Efficient randomized pattern-matching algorithms
- Fault Tolerant Sorting Networks
- Algorithms on Strings, Trees and Sequences
- Computing with Noisy Information
- Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting
- Data structures resilient to memory faults
- Lossless Fault-Tolerant Data Structures with Additive Overhead
- Comparison-based search in the presence of errors
- Checking and Spot-Checking the Correctness of Priority Queues
- Computer Aided Verification
- Searching games with errors -- fifty years of coping with liars
This page was built for publication: Resilient dynamic programming
