The current model of time in multimedia frameworks poses particular problems when designing multimedia systems with timebased interaction. We propose to expand and extend an exist...
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
Abstract. An autonomous agent may largely benefit from its ability to reconstruct another agent’s reasoning principles from records of past events and general knowledge about th...