Efficient memo-table management strategies
From MaRDI portal
Publication:582879
DOI10.1007/BF02983374zbMATH Open0691.68018MaRDI QIDQ582879FDOQ582879
Authors: Hessam Khoshnevisan 
Publication date: 1990
Published in: Acta Informatica (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Elimination of recursive calls using a small table of “randomly” selected function values
- Title not available (Why is that?)
- A Transformation System for Developing Recursive Programs
- Title not available (Why is that?)
- A synthesis of several sorting algorithms
- Can programming be liberated from the von Neumann style?
- 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
- Eliminating Redundant Recursive Calls.
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Development of the Algebra of Functional Programs
- Improving programs by the introduction of recursion
- An example of hierarchical design and proof
- Title not available (Why is that?)
Cited In (7)
- Applicative caching
- Zippy Tabulations of Recursive Functions
- Approximation of function evaluation over sequence arguments via specialized data structures
- A bounds inference method for vector-based memoization
- On sharing, memoization, and polynomial time
- On sharing, memoization, and polynomial time
- Verified memoization and dynamic programming
This page was built for publication: Efficient memo-table management strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582879)
