Cache-oblivious dynamic programming

DOI10.1145/1109557.1109622MaRDI QIDQ3581500zbMATH OpenOpenAlexFDO

Authors Vijaya Ramachandran, Rezaul Alam Chowdhury

Publication date 16 August 2010

Published in Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1109557.1109622

Mathematics Subject Classification ID

Computer system organization (68M99) General topics in the theory of algorithms (68W01) Nonnumerical algorithms (68W05) Dynamic programming (90C39)

Cited in

(9)

• An algorithm for the sequence alignment with gap penalty problem using multiway divide-and-conquer and matrix transposition
• Large-Scale Multiple Sequence Alignment and Phylogeny Estimation
• Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy
• Resilient dynamic programming
• The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation
• On the I/O complexity of the Cocke-Younger-Kasami algorithm and of a family of related dynamic programming algorithms
• The cache complexity of multithreaded cache oblivious algorithms
• Oblivious algorithms for multicores and networks of processors
• Solving path problems on the GPU

This page was built for publication: Cache-oblivious dynamic programming

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