Let Q() and Q() be algebraic number fields. We describe a new method to find (if they exist) all isomorphisms, Q() Q(). The algorithm is particularly efficient if the number of i...
This article explains how CORBA binds requests to object implementations with the help of an implementation repository. The design of the implementation repository has profound in...
A unidirectional heap is a heap where all pointers go in one direction, e.g. from newer to older objects. For a strict functional language, such as Erlang, the heap may be arranged...
We prove that any collection of n discs in which each one intersects at most k others, can be colored with at most O(log3 k) colors so that for each point p in the union of all di...