Journal of the ACM (JACM)
Journal of the ACM (JACM)
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Time-Space Trade-Offs in a Pebble Game
Proceedings of the Fourth Colloquium on Automata, Languages and Programming
Space bounds for a game on graphs
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Time-space tradeoffs for computing functions, using connectivity properties of their circuits
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Eliminating Redundant Recursive Calls.
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sublinear-space evaluation algorithms for attribute grammars
ACM Transactions on Programming Languages and Systems (TOPLAS)
Asymptotically tight bounds on time-space trade-offs in a pebble game
Journal of the ACM (JACM)
Graph pebbling with many free pebbles can be difficult
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Backing up in singly linked lists
Journal of the ACM (JACM)
| Hi-index | 0.00 |
A linear recursive procedure is one in which a procedural call can activate at most one other procedural call. When linear recursion cannot be replaced by iteration, it is usually implemented with a stack of size proportional to the depth of recursion. In this paper we analyze implementations of linear recursion which permit large reductions in storage space at the expense of a small increase in computation time. For example, if the depth of recursion is n, storage space can be reduced to √n at the cost of a constant factor increase in running time. The problem is treated by abstracting linear recursion into the pebbling of a simple graph and for this abstraction we exhibit the optimal space-time tradeoffs.