The dynamism and heterogeneity in ubicomp environments on both short and long time scales implies that middleware platforms for these environments need to be designed ground up fo...
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Abstract The LLL algorithm aims at finding a “reduced” basis of a Euclidean lattice. The LLL algorithm plays a primary role in many areas of mathematics and computer science. ...
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...