A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
We show that if any one-way function exists, then 3-round concurrent zero-knowledge arguments for all NP problems can be built in a model where a short auxiliary string with a pres...
We present the universe model,a new approach to concurrencymanagement that isolates concurrency concerns and represents them in the modular interface of a component. This approach...
In this paper we propose a new class of scheduling policies, dubbed Concurrent Gang, that combines the advantages of gang scheduling for communication and synchronization intensiv...
This paper presents an open, concurrent model of adaptive hypermedia all its functionality and data are completely distributed on a web of autonomous actors. The model that enable...