Lazy dynamic-programming can be eager

DOI10.1016/0020-0190(92)90202-7MaRDI QIDQ1199883zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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

edit-distancefunctional programminglazy evaluation

Mathematics Subject Classification ID

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

Cites work

• An algorithm for the distance between two finite sequences
• scientific article; zbMATH DE number 3845091 (Why is no real title available?)
• scientific article; zbMATH DE number 194911 (Why is no real title available?)
• The String-to-String Correction Problem
• Using circular programs to eliminate multiple traversals of data

Cited in

(3)

• Lazy or eager dynamic matching may not be fast
• \textsc{AStarix}: fast and optimal sequence-to-graph alignment
• Efficient parallel and incremental parsing of practical context-free languages

This page was built for publication: Lazy dynamic-programming can be eager

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