Asymptotically tight bounds on time-space trade-offs in a pebble game
- 1 October 1982
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 29 (4) , 1087-1130
- https://doi.org/10.1145/322344.322354
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- A note on the pebble gameInformation Processing Letters, 1980
- Comparative schematology and pebbling with auxiliary pushdowns (Preliminary Version)Published by Association for Computing Machinery (ACM) ,1980
- Time-space tradeoffs for some algebraic problemsPublished by Association for Computing Machinery (ACM) ,1980
- A comparison between two variations of a pebble game on graphsPublished by Springer Nature ,1979
- A Time-Space Trade-OffJournal of the ACM, 1978
- A pspace complete problem related to a pebble gamePublished by Springer Nature ,1978
- On Time Versus SpaceJournal of the ACM, 1977
- Storage requirements for deterministic polynomialtime recognizable languagesJournal of Computer and System Sciences, 1976
- On sparse graphs with dense long pathsComputers & Mathematics with Applications, 1975
- An observation on time-storage trade offJournal of Computer and System Sciences, 1974