Pebble games for studying storage sharing
From MaRDI portal
Publication:1162159
DOI10.1016/0304-3975(82)90015-9zbMath0479.68070OpenAlexW2014250416MaRDI QIDQ1162159
Publication date: 1982
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(82)90015-9
directed acyclic graphaccessible storagesemantics directed compiler generationserializability of database updates
Related Items
Global storage cells for attributes in an attribute grammar ⋮ A comparison of storage optimizations in automatically-generated attribute evaluators
Cites Work
- An observation on time-storage trade off
- Storage requirements for deterministic polynomial time recognizable languages
- The serializability of concurrent database updates
- The Pebbling Problem is Complete in Polynomial Space
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Useless Actions Make a Difference
- Deriving Target Code as a Representation of Continuation Semantics
- Complete Register Allocation Problems
- The notions of consistency and predicate locks in a database system
- On Time Versus Space
- Space bounds for a game on graphs
- Optimization of Straight Line Programs
- Unnamed Item
- Unnamed Item
- Unnamed Item
