A token is hidden in one out of n boxes following some known probability distribution and then all the boxes are locked. The goal of a searcher is to find the token in at most D n...
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Abstract. To realize Weiser’s vision of ubiquitous computing, a popular approach has been to create so-called smart living objects, which are everyday objects in our living envir...
The relation between atomistic structure, architecture, molecular weight and material properties is a basic concern of modern soft material science. This by now goes far beyond st...
Matej Praprotnik, Christoph Junghans, Luigi Delle ...
Managing trust is a key issue for a wide acceptance of P2P computing, particularly in critical areas such as e-commerce. Reputation-based trust management has been identified in t...