Online travel support systems have often been cited as an ideal proving ground for agent-based architectures, yet no working systems have materialized. Over the last few years we ...
This paper investigates an approach for statically preventing race conditions in an object-oriented language. The setting of this work is a variant of Gordon and Hankin’s concurr...
Numerous cryptosystems have been designed to be secure under the assumption that the computation of discrete logarithms is infeasible. This paper reports on an aggressive attempt ...
Abstract. We add name groups and group creation to the typed ambient calculus. Group creation is surprisingly interesting: it has the e ect of statically preventing certain communi...
One way to find closest pairs in large datasets is to use hash functions [6], [12]. In recent years locality-sensitive hash functions for various metrics have been given: projecti...