A fixed-point free involution on a finite set S is defined as a bijection I : S S such as e S, I(I(e)) = e and e S, I(e) = e. In this article, the fixed-point free involutions ...
For a set of distances D = {d1, . . . , dk} a set A is called D-avoiding if no pair of points of A is at distance di for some i. We show that the density of A is exponentially sma...
In this paper we survey some well-known approaches proposed as general models for calculi dealing with names (like for example process calculi with name-passing). We focus on (pre)...
In this paper we consider some families of random Cantor sets on the line and investigate the question whether the condition that the sum of Hausdorff dimension is larger than one ...
Abstract. This paper presents the concept of parallelisation of a solver for Answer Set Programming (ASP). While there already exist some approaches to parallel ASP solving, there ...
Lars Schneidenbach, Bettina Schnor, Martin Gebser,...