Pebble games for studying storage sharing
- 31 July 1982
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 19 (1), 69-84
- https://doi.org/10.1016/0304-3975(82)90015-9
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- The Pebbling Problem is Complete in Polynomial SpaceSIAM Journal on Computing, 1980
- The serializability of concurrent database updatesJournal of the ACM, 1979
- On Time Versus SpaceJournal of the ACM, 1977
- Space bounds for a game on graphsTheory of Computing Systems, 1976
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976
- Storage requirements for deterministic polynomialtime recognizable languagesJournal of Computer and System Sciences, 1976
- An observation on time-storage trade offJournal of Computer and System Sciences, 1974
- Optimization of Straight Line ProgramsSIAM Journal on Computing, 1972
- Computational Chains and the Simplification of Computer ProgramsIEEE Transactions on Electronic Computers, 1962