Modeling of software architectures is a fundamental part of software development processes. Reuse of software components and early analysis of software topologies allow the reduct...
Arne Haber, Thomas Kutz, Holger Rendel, Bernhard R...
We study ideals in the computably enumerable Turing degrees, and their upper bounds. Every proper Σ0 4 ideal in the c.e. Turing degrees has an incomplete upper bound. It follows t...
The Suslin operator E1 is a type-2 functional testing for the wellfoundedness of binary relations on the natural numbers. In the context of applicative theories, its proof-theoret...
Abstract—The fused multiply accumulate-add (FMA) instruction, specified by the IEEE 754-2008 Standard for Floating-Point Arithmetic, eases some calculations, and is already avai...
The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove t...