Recursion Schemes for Dynamic Programming

  • Jevgeni Kabanov
  • Varmo Vene
Conference paper

DOI: 10.1007/11783596_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4014)
Cite this paper as:
Kabanov J., Vene V. (2006) Recursion Schemes for Dynamic Programming. In: Uustalu T. (eds) Mathematics of Program Construction. MPC 2006. Lecture Notes in Computer Science, vol 4014. Springer, Berlin, Heidelberg

Abstract

Dynamic programming is an algorithm design technique, which allows to improve efficiency by avoiding re-computation of identical subtasks. We present a new recursion combinator, dynamorphism, which captures the dynamic programming recursion pattern with memoization and identify some simple conditions when functions defined by structured general recursion can be redefined as a dynamorphism. The applicability of the new recursion combinator is demonstrated on classical dynamic programming algorithms: Fibonacci numbers, binary partitions, edit distance and longest common subsequence.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jevgeni Kabanov
    • 1
  • Varmo Vene
    • 1
  1. 1.Dept. of Computer ScienceUniversity of TartuTartuEstonia

Personalised recommendations