Recursion Schemes for Dynamic Programming

DOI10.1007/11783596_15MaRDI QIDQ3618825zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jevgeni Kabanov, Varmo Vene

Publication date 2 April 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11783596_15

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Abstract data types; algebraic specification (68Q65)

Recommendations

• Dynamic programming via static incrementalization
• Algebraic dynamic programming
• A discipline of dynamic programming over sequence data
• Verified memoization and dynamic programming
• Unifying dynamic programming design patterns

Cited in

(16)

• Dynamic programming via thinning and incrementalization
• Dynamic programming via static incrementalization
• Fantastic morphisms and where to find them. A guide to recursion schemes
• Unifying dynamic programming design patterns
• Tailoring recursion for complexity
• The Expression Lemma
• A bounds inference method for vector-based memoization
• Tiering as a Recursion Technique
• Table design in dynamic programming
• Categories, relations and dynamic programming
• Sneaking around concatmap, efficient combinators for dynamic programming
• Two extensions of System F with (co)iteration and primitive (co)recursion principles
• Some remarks on type systems for course-of-value recursion
• Verified memoization and dynamic programming
• There and back again
• A short cut to optimal sequences

This page was built for publication: Recursion Schemes for Dynamic Programming

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