Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Real-time resource scheduling is an important factor for improving the performance of cluster computing. In many distributed and parallel processing systems, particularly real-tim...
As the complexity of computing systems steadily increases, self-managing systems – as Autonomic Computing Systems (ACS) proposed by IBM – are an adequate approach to minimize ...
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components and assemble them so that they commu...