Space-time tradeoffs for linear recursion
- 1 December 1983
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 16 (1) , 9-27
- https://doi.org/10.1007/bf01744566
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble GameJournal of the ACM, 1980
- Graph pebbling with many free pebbles can be difficultPublished by Association for Computing Machinery (ACM) ,1980
- Upper and lower bounds on time-space tradeoffsPublished by Association for Computing Machinery (ACM) ,1979
- Space-time trade-offs on the FFT algorithmIEEE Transactions on Information Theory, 1978
- A Time-Space Trade-OffJournal of the ACM, 1978
- A pspace complete problem related to a pebble gamePublished by Springer Nature ,1978
- Time-space trade-offs in a pebble gameActa Informatica, 1978
- On Time Versus SpaceJournal of the ACM, 1977
- Space bounds for a game on graphsTheory of Computing Systems, 1976
- Efficient compilation of linear recursive programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1973