Efficiency by Incrementalization: An Introduction
Author:
- 1 December 2000
- journal article
- Published by Springer Nature in Higher-Order and Symbolic Computation
- Vol. 13 (4) , 289-313
Abstract
No abstract availableKeywords
This publication has 66 references indexed in Scilit:
- Eliminating Dead Code on Recursive Data1999
- Dynamic Programming via Static IncrementalizationLecture Notes in Computer Science, 1999
- The Formal Reconstruction and Speedup Of The Linear Time Fragment Of Willard’s Relational Calculus Subset1997
- Principled strength reduction1997
- An Incremental Algorithm for a Generalization of the Shortest-Path ProblemJournal of Algorithms, 1996
- Non-restoring integer square root: A case study in design by principled optimization1995
- Viewing a program transformation system at workLecture Notes in Computer Science, 1994
- Symbolic finite differencing - Part I1990
- Lazy memo-functions1985
- The Science of Programming1981