Pebble games for studying storage sharing

DOI10.1016/0304-3975(82)90015-9MaRDI QIDQ1162159zbMATH OpenOpenAlexFDO

Authors Ravi Sethi

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

zbMATH Keywords

directed acyclic graphaccessible storagesemantics directed compiler generationserializability of database updates

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Cites work

• scientific article; zbMATH DE number 3551859 (Why is no real title available?)
• scientific article; zbMATH DE number 3622921 (Why is no real title available?)
• scientific article; zbMATH DE number 3194810 (Why is no real title available?)
• An observation on time-storage trade off
• Complete Register Allocation Problems
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Deriving Target Code as a Representation of Continuation Semantics
• On Time Versus Space
• Optimization of Straight Line Programs
• Space bounds for a game on graphs
• Storage requirements for deterministic polynomial time recognizable languages
• The Pebbling Problem is Complete in Polynomial Space
• The notions of consistency and predicate locks in a database system
• The serializability of concurrent database updates
• Useless Actions Make a Difference

Cited in

(2)

• Global storage cells for attributes in an attribute grammar
• A comparison of storage optimizations in automatically-generated attribute evaluators

This page was built for publication: Pebble games for studying storage sharing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1162159)