A general theory of sharing graphs
From MaRDI portal
Recommendations
- On the dynamics of sharing graphs
- Bigraphs with sharing
- Graph sharing games: complexity and connectivity
- Graph sharing games: complexity and connectivity
- The fair sharing graph and its Helly property
- Sharing in the graph rewriting calculus
- Secret sharing schemes on graphs
- scientific article; zbMATH DE number 1523048
- Graph sharing
- A note on concurrent graph sharing games
Cited in
(20)- Coherence for sharing proof-nets
- Proof nets, garbage, and computations
- Maximal sharing in the lambda calculus with letrec
- An abstract concept of optimal implementation
- Sharing implementations of graph rewriting systems
- The ramifications of sharing in data structures
- Three syntactic theories for combinatory graph reduction
- Directed virtual reductions
- scientific article; zbMATH DE number 1523048 (Why is no real title available?)
- Sharing continuations: Proofnets for languages with explicit control
- On the dynamics of sharing graphs
- scientific article; zbMATH DE number 2154394 (Why is no real title available?)
- Models of sharing graphs. A categorical semantics of let and letrec
- Is the Optimal Implementation Inefficient? Elementarily Not
- scientific article; zbMATH DE number 7205326 (Why is no real title available?)
- A Characterization of Undirected Graphs Admitting Optimal Cost Shares
- Atomic lambda calculus: a typed lambda-calculus with explicit sharing
- On global dynamics of optimal graph reduction
- Light logics and optimal reduction: completeness and complexity
- Resource operators for \(\lambda\)-calculus
This page was built for publication: A general theory of sharing graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575875)
