Lazy dynamic-programming can be eager

DOI10.1016/0020-0190(92)90202-7zbMath0763.68022OpenAlexW2093700795WikidataQ62654289 ScholiaQ62654289MaRDI QIDQ1199883

Lloyd Allison

Publication date: 17 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90202-7

zbMATH Keywords

lazy evaluationfunctional programmingedit-distance

Mathematics Subject Classification ID

Dynamic programming (90C39) Theory of programming languages (68N15) General topics in the theory of software (68N01)

Related Items

AStarix: Fast and Optimal Sequence-to-Graph Alignment ⋮ Efficient parallel and incremental parsing of practical context-free languages

Cites Work

• Using circular programs to eliminate multiple traversals of data
• An algorithm for the distance between two finite sequences
• The String-to-String Correction Problem
• Unnamed Item
• Unnamed Item