Efficient memo-table management strategies

DOI10.1007/BF02983374zbMath0691.68018MaRDI QIDQ582879

Hessam Khoshnevisan

Publication date: 1990

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingfunctional language HOPEmemo-functionsmemo-table

Mathematics Subject Classification ID

Dynamic programming (90C39) Theory of programming languages (68N15) Data structures (68P05)

Related Items (1)

Approximation of function evaluation over sequence arguments via specialized data structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transformational programming and the paragraph problem
• Linearisation: An optimisation for nonlinear functional programs
• A system which automatically improves programs
• A family of rules for recursion removal
• A synthesis of several sorting algorithms
• Eliminating Redundant Recursive Calls.
• On the Development of the Algebra of Functional Programs
• Elimination of recursive calls using a small table of “randomly” selected function values
• A Transformation System for Developing Recursive Programs
• Improving programs by the introduction of recursion
• Can programming be liberated from the von Neumann style?
• An example of hierarchical design and proof

This page was built for publication: Efficient memo-table management strategies