Eliminating Redundant Recursive Calls.

DOI10.1145/2166.2167zbMath0526.68004OpenAlexW2023647809MaRDI QIDQ3040478

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

pebblingrecursive programsrecursion removalspace boundsprogram improvementredundant computation

Mathematics Subject Classification ID

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

Related Items (6)

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

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