9 citations · 12 across the 4 of their papers we have counts for
5 papers
Time and Space Measures for a Complete Graph Computation Model
Brian Courtehoute, Detlef Plump
We present a computation model based on a subclass of GP 2 graph programs which can simulate any off-line Turing machine of space complexity O(s(n) log s(n)) in space O(s(n)). The…
A Small-Step Operational Semantics for GP 2
Brian Courtehoute, Detlef Plump
The operational semantics of a programming language is said to be small-step if each transition step is an atomic computation step in the language. A semantics with this property f…
Fast Rule-Based Graph Programs
Graham Campbell, Brian Courtehoute, Detlef Plump
Implementing graph algorithms efficiently in a rule-based language is challenging because graph pattern matching is expensive. In this paper, we present a number of linear-time imp…
A Fast Graph Program for Computing Minimum Spanning Trees
Brian Courtehoute, Detlef Plump
When using graph transformation rules to implement graph algorithms, a challenge is to match the efficiency of programs in conventional languages. To help overcome that challenge,…
A Diagrammatic Approach to Quantum Dynamics
Stefano Gogioso
We present a diagrammatic approach to quantum dynamics based on the categorical algebraic structure of strongly complementary observables. We provide physical semantics to our appr…