Sciweavers

284 search results - page 34 / 57
» Modularity of Completeness Revisited
Sort
View
INFOCOM
2010
IEEE
13 years 8 months ago
Topological Properties Affect the Power of Network Coding in Decentralized Broadcast
—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 ...
Di Niu, Baochun Li
CADE
2011
Springer
12 years 9 months ago
Deciding Security for Protocols with Recursive Tests
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...
Mathilde Arnaud, Véronique Cortier, St&eacu...
EUROMICRO
2006
IEEE
14 years 3 months ago
Real-Time Modelling of Distributed Component-Based Applications
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...
Patricia López Martínez, Julio L. Me...
CRYPTO
2012
Springer
223views Cryptology» more  CRYPTO 2012»
12 years 9 days ago
Collusion-Preserving Computation
In collusion-free protocols, subliminal communication is impossible and parties are thus unable to communicate “any information beyond what the protocol allows”. Collusion-fre...
Joël Alwen, Jonathan Katz, Ueli Maurer, Vassi...
ICLP
2009
Springer
14 years 10 months ago
A Language for Large Ensembles of Independently Executing Nodes
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 ...
Michael P. Ashley-Rollman, Peter Lee, Seth Copen G...