284 search results - page 34 / 57 » Modularity of Completeness Revisited |
97
Voted
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
—There exists a certain level of ambiguity regarding whether network coding can further improve download performance in P2P content distribution systems, as compared to commonly ...
234
Voted
CADE
2011
Springer
14 years 2 months ago
2011
Springer
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...
119
Voted
EUROMICRO
2006
IEEE
15 years 8 months ago
2006
IEEE
This paper presents a modular modelling methodology to formulate the timing behaviour of real-time distributed component-based applications. It allows to build real-time models of...
116
Voted
CRYPTO
2012
Springer
13 years 5 months ago
2012
Springer
In collusion-free protocols, subliminal communication is impossible and parties are thus unable to communicate “any information beyond what the protocol allows”. Collusion-fre...
237
Voted
ICLP
2009
Springer
16 years 3 months ago
2009
Springer
We address how to write programs for distributed computing systems in which the network topology can change dynamically. Examples of such systems, which we call ensembles, include ...