Recursion Schemes for Dynamic Programming
From MaRDI portal
Recommendations
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)