Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
Abstract. The simple intramolecular model for gene assembly in ciliates is particularly interesting because it can predict the correct assembly of all available experimental data, ...
Abstract. Service oriented architectures (SOA) are becoming reality in a corporate environment. Rather than pure technology improvements SOA intends to increase manageability and s...
Stephan Aier, Maximilian Ahrens, Matthias Stutz, U...
Abstract. In this paper we investigate a family of partial dierential equations (PDEs) for image processing which can be regarded as isotropic nonlinear diusion with an additiona...