Eliminating Redundant Recursive Calls.

DOI10.1145/2166.2167MaRDI QIDQ3040478zbMATH OpenOpenAlexFDO

Authors Norman Howard Cohen

Publication date 1983

Published in ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2166.2167

zbMATH Keywords

pebblingprogram improvementrecursion removalrecursive programsredundant computationspace bounds

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Graph theory (including graph drawing) in computer science (68R10) Discrete mathematics in relation to computer science (68R99) Artificial intelligence (68T99)

Cited in

(6)

• Partial memoization for obtaining linear time behavior of a 2DPDA
• Recursive information transducers: Computation models
• A short cut to optimal sequences
• A transformation method for dynamic-sized tabulation
• Efficient memo-table management strategies
• Essence of generalized partial computation

This page was built for publication: Eliminating Redundant Recursive Calls.

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