Dynamic programming via static incrementalization

DOI10.1023/A:1023068020483MaRDI QIDQ1404292zbMATH OpenFDO

Authors Yanhong A. Liu, Scott D. Stoller

Publication date 21 August 2003

Published in Higher-Order and Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingpruningstatic analysisincremental computationmemoizationprogram optimizationtabulationcachingprogram transformationincremental updatedependence analysisincrementalization

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Dynamic programming via thinning and incrementalization
• Recursion Schemes for Dynamic Programming
• Efficiency by incrmentalization: An introduction
• Algebraic dynamic programming
• Table design in dynamic programming

Cited in

(9)

• Dynamic programming via thinning and incrementalization
• Systematic derivation of incremental programs
• Efficiency by incrmentalization: An introduction
• Revisiting ``Computation of matrix chain products
• Iterate, incrementalize, and implement: a systematic approach to efficiency improvement and guarantees
• Incremental \(\lambda \)-calculus in cache-transfer style. Static memoization by program transformation
• Table design in dynamic programming
• Recursion Schemes for Dynamic Programming
• A short cut to optimal sequences

This page was built for publication: Dynamic programming via static incrementalization

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